An efficient algorithm for a job shop problem
Authors:
- 1 December 1995
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 57 (1) , 203-216
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problemEuropean Journal of Operational Research, 1989
- Scheduling unit-time tasks with integer release times and deadlinesInformation Processing Letters, 1983
- An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length ProblemMathematics of Operations Research, 1982
- Minimizing maximum lateness in a two-machine unit-time job shopComputing, 1981
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Flowshop and Jobshop Schedules: Complexity and ApproximationOperations Research, 1978
- Complexity of Machine Scheduling Problems1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- 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