Lot streaming in the two-machine flow shop with setup times
- 1 December 1995
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 57 (1) , 1-11
- https://doi.org/10.1007/bf02099687
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Basic Techniques for Lot StreamingOperations Research, 1993
- Unit sized transfer batch scheduling with setup timesComputers & Industrial Engineering, 1992
- Flow shop scheduling with lot streamingOperations Research Letters, 1989
- A concise survey of efficiently solvable special cases of the permutation flow-shop problemRairo-Operations Research, 1983
- An experimental investigation of the occurrence of special cases in the three-machine flowshop problemInternational Journal of Production Research, 1981
- A General Bounding Scheme for the Permutation Flow-Shop ProblemOperations Research, 1978
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time LagsManagement Science, 1959
- Sequencing n Jobs on Two Machines with Arbitrary Time LagsManagement Science, 1959
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954