Minimizing Maximum Lateness in a Two-Machine Open Shop
From MaRDI portal
Publication:3960459
DOI10.1287/moor.6.1.153zbMath0496.90047WikidataQ101378292 ScholiaQ101378292MaRDI QIDQ3960459
Eugene L. Lawler, Alexander H. G. Rinnooy Kan, Jan Karel Lenstra
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
due dates; preemption; linear-time algorithm; NP- hardness; minimization of maximum lateness; scheduling independent jobs; two- machine open shop
90B35: Deterministic scheduling theory in operations research
Related Items
An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system, Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm, Scheduling ordered open shops, Scheduling preemptive open shops to minimize total tardiness, A note on the flow time and the number of tardy jobs in stochastic open shops, Dense open-shop schedules with release times, On the complexity of preemptive open-shop scheduling problems, Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival, The two-machine flowshop scheduling problem with total tardiness, On the complexity of generalized due date scheduling problems, Job lateness in a two-machine flowshop with setup times separated, Two scheduling problems with fuzzy due-dates, The generalized shifting bottleneck procedure, Two machine open shop scheduling problems with bi-criteria, On the complexity of preemptive openshop scheduling problems, One machine scheduling problem with fuzzy duedates, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, Open shop scheduling problems with late work criteria., An efficient tabu search approach for the two-machine preemptive open shop scheduling problem., A linear time approximation scheme for makespan minimization in an open shop with release dates, Scheduling two-machine preemptive open shops to minimize total completion time, Complexity of mixed shop scheduling problems: A survey, A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures, Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness, Multicriteria scheduling
