Minimizing Maximum Lateness in a Two-Machine Open Shop

DOI10.1287/MOOR.6.1.153zbMath0496.90047OpenAlexW2021250661WikidataQ101378292 ScholiaQ101378292MaRDI QIDQ3960459

Alexander H. G. Rinnooy Kan, Jan Karel Lenstra, Eugene L. Lawler

Publication date: 1981

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.6.1.153

zbMATH Keywords

due datespreemptionlinear-time algorithmNP- hardnessminimization of maximum latenessscheduling independent jobstwo- machine open shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (31)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Two machine open shop scheduling problems with bi-criteria ⋮ On the complexity of preemptive openshop scheduling problems ⋮ Scheduling two-machine preemptive open shops to minimize total completion time ⋮ One machine scheduling problem with fuzzy duedates ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates ⋮ Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival ⋮ The two-machine flowshop scheduling problem with total tardiness ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ On the complexity of proportionate open shop and job shop problems ⋮ Open shop scheduling problems with late work criteria. ⋮ An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. ⋮ An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system ⋮ Complexity of mixed shop scheduling problems: A survey ⋮ On the complexity of generalized due date scheduling problems ⋮ Job lateness in a two-machine flowshop with setup times separated ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Dense open-shop schedules with release times ⋮ Two scheduling problems with fuzzy due-dates ⋮ A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures ⋮ Scheduling preemptive open shops to minimize total tardiness ⋮ Scheduling ordered open shops ⋮ The generalized shifting bottleneck procedure ⋮ Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm ⋮ Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop ⋮ Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness ⋮ Multicriteria scheduling ⋮ A note on the flow time and the number of tardy jobs in stochastic open shops ⋮ On the complexity of preemptive open-shop scheduling problems ⋮ A linear time approximation scheme for makespan minimization in an open shop with release dates

This page was built for publication: Minimizing Maximum Lateness in a Two-Machine Open Shop