Minimizing maximum lateness on one machine: computational experience and some applications
Authors:
- 1 March 1976
- journal article
- Published by Wiley in Statistica Neerlandica
- Vol. 30 (1) , 25-41
Abstract
Summary: We consider the problem of scheduling jobs on a single machine subject to given release dates and precedence constraints, in order to minimize maximum lateness. The algorithms of Baker and Su (Naval Res. Logist. Quart. 21 (1974) 171–176) and of McMahon and Florian (Operations Res. 23 (1975) 475–482) for the problem without precedence constraints are extended to the general case. An extensive computational comparison establishes the superiority of the latter algorithm. We describe applications to the theory of job‐shop scheduling and to a practical scheduling situation.Keywords
This publication has 13 references indexed in Scilit:
- Some simple scheduling algorithmsNaval Research Logistics Quarterly, 1974
- Sequencing with due‐dates and early start times to minimize maximum tardinessNaval Research Logistics Quarterly, 1974
- On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problemNaval Research Logistics Quarterly, 1973
- The One-Machine Sequencing Problem with Early Starts and Due DatesA I I E Transactions, 1972
- An Implicit Enumeration Algorithm for the Machine Sequencing ProblemManagement Science, 1971
- A Method of Solution for General Machine-Scheduling ProblemsOperations Research, 1970
- A Generalized Machine-Scheduling AlgorithmJournal of the Operational Research Society, 1970
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954