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

DOI10.1016/0305-0548(94)00027-6zbMATH Open0827.90075OpenAlexW2012377923MaRDI QIDQ1891237FDOQ1891237

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

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

zbMATH Keywords

identical parallel machinesdifferent due dates and release times

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• 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
• Minimizing the weighted number of tardy jobs on multiple machines: a review

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)