Error Bound of a Heuristic for the Common Due Date Scheduling Problem

DOI10.1287/IJOC.5.4.420MaRDI QIDQ4282273zbMATH OpenOpenAlexFDO

Authors Surya Danusaputro Liman, Chung-Yee Lee

Publication date 24 March 1994

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.5.4.420

zbMATH Keywords

heuristiccommon due date\(n\)-job, one-machine nonpreemptive scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
• A common due-data assignment problem on parallel identical machines
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Scheduling about a common due date with earliness and tardiness penalties
• A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines

Cited in

(4)

• A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
• Parallel machine scheduling with a common due window
• Due window scheduling for parallel machines
• Scheduling with batch setup times and earliness-tardiness penalties

This page was built for publication: Error Bound of a Heuristic for the Common Due Date Scheduling Problem

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