Two- and three-machine flow shop scheduling problems with equal sized transfer batches
- 8 July 1992
- journal article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 30 (7) , 1551-1574
- https://doi.org/10.1080/00207549208948107
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- REPETITIVE LOTS: FLOW‐TIME REDUCTIONS THROUGH SEQUENCING AND DYNAMIC BATCH SIZINGDecision Sciences, 1988
- Batching to Minimize Flow Times on One MachineManagement Science, 1987
- Note—Lot-Sizing and Sequencing DelaysManagement Science, 1987
- Lot Sizes, Lead Times and In-Process InventoriesManagement Science, 1987
- Lotsizing in Multi-Item Multi- Machine Job ShopsIIE Transactions, 1985
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯Journal of the ACM, 1975
- A note on a paper by W. SzwarcNaval Research Logistics Quarterly, 1971
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- Discussion: 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