Scheduling and the problem of computational complexity
- 31 December 1979
- Vol. 7 (3) , 233-240
- https://doi.org/10.1016/0305-0483(79)90058-6
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence ConstraintsPublished by Elsevier ,1978
- The Efficiency of AlgorithmsScientific American, 1978
- A New Bound for Machine SchedulingJournal of the Operational Research Society, 1976
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968
- Flow-Shop Scheduling with the Branch-and-Bound MethodOperations Research, 1967
- Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling ProblemJournal of the Operational Research Society, 1966
- A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling ProblemJournal of the Operational Research Society, 1965
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- An extension of Johnson's results on job IDT schedulingNaval Research Logistics Quarterly, 1956
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954