Pages that link to "Item:Q3960459"

The following pages link to Minimizing Maximum Lateness in a Two-Machine Open Shop (Q3960459):

Displaying 29 items.

• Scheduling ordered open shops (Q580167) (← links)
• Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
• A note on the flow time and the number of tardy jobs in stochastic open shops (Q796445) (← links)
• Dense open-shop schedules with release times (Q955015) (← links)
• Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← links)
• On the complexity of preemptive open-shop scheduling problems (Q1058969) (← links)
• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
• The two-machine flowshop scheduling problem with total tardiness (Q1115798) (← links)
• On the complexity of generalized due date scheduling problems (Q1175769) (← links)
• Job lateness in a two-machine flowshop with setup times separated (Q1184446) (← links)
• Two scheduling problems with fuzzy due-dates (Q1198861) (← links)
• The generalized shifting bottleneck procedure (Q1268190) (← links)
• Two machine open shop scheduling problems with bi-criteria (Q1331894) (← links)
• On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
• One machine scheduling problem with fuzzy duedates (Q1342032) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• Open shop scheduling problems with late work criteria. (Q1421458) (← links)
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
• A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
• Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
• Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates (Q2160790) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures (Q2475628) (← links)
• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness (Q2563893) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• On the complexity of proportionate open shop and job shop problems (Q6181381) (← links)