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

DOI10.1016/0305-0548(94)00027-6MaRDI QIDQ1891237zbMATHOpenAlexFDO

Authors 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)

Recommendations

• A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
• Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
• Scheduling on parallel identical machines to minimize total tardiness
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem

Cites work

• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3430360 (Why is no real title available?)
• A Simple Optimality Proof of Moore's Sequencing Algorithm
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Linear-Time Algorithms for Scheduling on Parallel Processors
• On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs
• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs

Cited in

(3)

• Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines

This page was built for publication: A heuristic for parallel machine scheduling with agreeable due dates 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 Q1891237)