Complexity of Machine Scheduling Problems
- 1 January 1977
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 33 references indexed in Scilit:
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976
- Minimizing maximum lateness on one machine: computational experience and some applicationsStatistica Neerlandica, 1976
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Some Simple Applications of the Travelling Salesman ProblemJournal of the Operational Research Society, 1975
- A terminological proposalACM SIGACT News, 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
- On the Flow-Shop Sequencing Problem with No Wait in Process†Journal of the Operational Research Society, 1972
- An extension of Johnson's results on job IDT schedulingNaval Research Logistics Quarterly, 1956
- 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