Customer order scheduling to minimize the number of late jobs
From MaRDI portal
Publication:2371386
DOI10.1016/j.ejor.2006.10.021zbMath1180.90128MaRDI QIDQ2371386
Bertrand M. T. Lin, Alexander V. Kononov
Publication date: 4 July 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.10.021
90B35: Deterministic scheduling theory in operations research
Related Items
An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems, Minimizing maximum delivery completion time for order scheduling with rejection, Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures, Tailoring customer order scheduling search algorithms, Minimizing the weighted number of tardy jobs on multiple machines: a review, Minimizing the number of tardy jobs in two-machine settings with common due date, Scheduling with centralized and decentralized batching policies in concurrent open shops
Cites Work
- Unnamed Item
- A note on the complexity of the concurrent open shop problem
- A fast approximation algorithm for the multicovering problem
- Open shops with jobs overlap
- Concurrent open shop scheduling to minimize the weighted number of tardy jobs
- Scheduling orders for multiple product types with due date related objectives
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem