A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs

DOI10.1016/0305-0548(94)00027-6zbMath0827.90075OpenAlexW2012377923MaRDI QIDQ1891237

Chung-Lun Li

Publication date: 30 May 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)00027-6

zbMATH Keywords

identical parallel machinesdifferent due dates and release times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Minimizing the weighted number of tardy jobs on multiple machines: a review

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
• Linear-Time Algorithms for Scheduling on Parallel Processors
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs
• A Simple Optimality Proof of Moore's Sequencing Algorithm