The following pages link to Gur Mosheiov (Q190064):
Displaying 50 items.
- Minimizing total completion time and total deviation of job completion times from a restrictive due-date (Q1776951) (← links)
- Scheduling with general job-dependent learning curves. (Q1873012) (← links)
- Comments on ''Flow shop and open shop scheduling with a critical machine and two operations per job'' (Q1877042) (← links)
- Simultaneous minimization of total completion time and total deviation of job completion times (Q1877049) (← links)
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs (Q1887796) (← links)
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs (Q1892102) (← links)
- Single machine scheduling to minimize the number of early and tardy jobs (Q1919786) (← links)
- Proportionate flowshops with general position-dependent processing times (Q1944066) (← links)
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance (Q2012897) (← links)
- Single machine lot scheduling with optional job-rejection (Q2025088) (← links)
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708) (← links)
- Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
- On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185) (← links)
- A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117) (← links)
- Minimizing total load on parallel machines with linear deterioration (Q2174916) (← links)
- Lot scheduling on a single machine to minimize the (weighted) number of tardy orders (Q2203602) (← links)
- Flowshop scheduling with learning effect and job rejection (Q2215196) (← links)
- A note on the single machine CON and CONW problems with lot scheduling (Q2230735) (← links)
- Minmax due-date assignment on a two-machine flowshop (Q2241579) (← links)
- Scheduling with a common due-window: polynomially solvable cases (Q2269806) (← links)
- Due-window assignment with identical jobs on parallel uniform machines (Q2355801) (← links)
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time (Q2384652) (← links)
- Scheduling with two competing agents to minimize total weighted earliness (Q2399317) (← links)
- Comments on ``Proportionate flowshops with general position dependent processing times'' and ``Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection'' (Q2414034) (← links)
- Due-date assignment and maintenance activity scheduling problem (Q2426080) (← links)
- An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs (Q2445244) (← links)
- Minmax due-date assignment with a time window for acceptable lead-times (Q2449349) (← links)
- A single machine batch scheduling problem with bounded batch size (Q2467253) (← links)
- Open-shop batch scheduling with identical jobs (Q2467272) (← links)
- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs (Q2483505) (← links)
- Minimizing flow-time on a single machine with integer batch sizes (Q2488201) (← links)
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs (Q2490167) (← links)
- Due-date assignment on uniform machines (Q2519077) (← links)
- Coupled task scheduling with convex resource consumption functions (Q2659170) (← links)
- Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work (Q2673557) (← links)
- Batch scheduling on a two-machine jobshop with machine-dependent setup times (Q2892129) (← links)
- A two-stage flow shop scheduling with a critical machine and batch availability (Q2978425) (← links)
- (Q3070928) (← links)
- (Q3071146) (← links)
- Batch scheduling with step-deteriorating processing times to minimize flowtime (Q3120638) (← links)
- Flow-shop batch scheduling with identical processing-time jobs (Q3156753) (← links)
- Smoothing time-series data by nonmetric polytone curves (Q3471563) (← links)
- A due-window assignment problem with position-dependent processing times (Q3519370) (← links)
- Scheduling a deteriorating maintenance activity on a single machine (Q3585714) (← links)
- Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines (Q3612208) (← links)
- Scheduling a maintenance activity on parallel identical machines (Q3621910) (← links)
- V-Shaped Policies for Scheduling Deteriorating Jobs (Q4006341) (← links)
- Simultaneous optimization of efficiency and performance belance measures in single-machine scheduling problems (Q4287985) (← links)
