A fast algorithm for single processor scheduling
- 1 October 1978
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (02725428) , 246-252
- https://doi.org/10.1109/sfcs.1978.4
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due TimesOperations Research, 1978
- Job-Shop Scheduling by Implicit EnumerationManagement Science, 1977
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- Minimizing maximum lateness on one machine: computational experience and some applicationsStatistica Neerlandica, 1976
- Some simple scheduling algorithmsNaval Research Logistics Quarterly, 1974
- Sequencing with due‐dates and early start times to minimize maximum tardinessNaval Research Logistics Quarterly, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972