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

DOI10.1287/OPRE.37.2.314zbMATH Open0672.90071OpenAlexW2022498940MaRDI QIDQ3826352FDOQ3826352

Authors: Eugene L. Lawler, Chip Martel 

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

Recommendations

• scientific article; zbMATH DE number 3883931
• Preemptive scheduling of two uniform parallel machines to minimize total tardiness
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Preemptive scheduling on uniform machines to minimize mean flow time

zbMATH Keywords

NP-hardparallel machinespolynomial timepreemptive schedulingfixed set of uniform machines

Mathematics Subject Classification ID

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

Cited In (28)

• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Minimizing total tardiness on parallel machines with preemptions
• A unified view of parallel machine scheduling with interdependent processing rates
• 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
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• 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.
• Optimal preemptive scheduling on uniform machines with discounted flowtime objectives
• A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
• Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
• Preemptive scheduling on uniform machines to minimize mean flow time
• Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
• Shop scheduling problems with pliable jobs
• Title not available (Why is that?)
• Scheduling with limited machine availability
• HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
• Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
• Minimizing makespan and preemption costs on a system of uniform machines
• Title not available (Why is that?)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• Preemptive scheduling with deadlines on parallel machines
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• Title not available (Why is that?)
• Minimizing the number of late jobs on unrelated machines
• Scheduling equal processing time jobs to minimize the weighted number of late jobs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3826352)