Some new results in flow shop scheduling
- 1 February 1984
- journal article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 28 (1) , 1-16
- https://doi.org/10.1007/bf01919082
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983
- Unit Execution Time Shop ProblemsMathematics of Operations Research, 1982
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job ShopsOperations Research, 1981
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Flowshop and Jobshop Schedules: Complexity and ApproximationOperations Research, 1978
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- On the Flow-Shop Sequencing Problem with No Wait in Process†Journal of the Operational Research Society, 1972
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1964
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954