Minimizing maximum lateness on one machine: computational experience and some applications
- 1 March 1976
- journal article
- Published by Wiley in Statistica Neerlandica
- Vol. 30 (1) , 25-41
- https://doi.org/10.1111/j.1467-9574.1976.tb00264.x
Abstract
No abstract availableKeywords
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