A note on generalizing the maximum lateness criterion for scheduling
From MaRDI portal
Publication:1315993
DOI10.1016/0166-218X(93)90087-5zbMath0795.90033MaRDI QIDQ1315993
Publication date: 17 March 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Cites Work
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Minimizing maximum lateness on one machine: computational experience and some applications
- `` Strong NP-Completeness Results
- Bounds for Certain Multiprocessing Anomalies
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Unnamed Item
- Unnamed Item
This page was built for publication: A note on generalizing the maximum lateness criterion for scheduling
