Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs

DOI10.1287/opre.37.2.314zbMath0672.90071OpenAlexW2022498940MaRDI QIDQ3826352

Charles U. Martel, Eugene L. Lawler

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1287/opre.37.2.314

zbMATH Keywords

parallel machinesNP-hardpolynomial timepreemptive schedulingfixed set of uniform machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs ⋮ Minimizing the number of tardy jobs for \(m\) parallel machines ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ Preemptive scheduling of two uniform parallel machines to minimize total tardiness ⋮ A note on the maximum number of on-time jobs on parallel identical machines. ⋮ Scheduling with limited machine availability ⋮ A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints ⋮ A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem ⋮ A unified view of parallel machine scheduling with interdependent processing rates ⋮ Shop scheduling problems with pliable jobs ⋮ Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs

This page was built for publication: Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs