A heuristic algorithm for two‐machine re‐entrant shop scheduling
Authors:
- I.G. DrobouchevitchIDI.G. Drobouchevitch
- V.A. StrusevichVSV.A. Strusevich
- 1 January 1999
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 86, 417-439
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Approximation algorithms for two-machine flow shop scheduling with batch setup timesMathematical Programming, 1998
- Short Shop SchedulesOperations Research, 1997
- A New Heuristic for Three-Machine Flow Shop SchedulingOperations Research, 1996
- Improved Approximation Algorithms for Shop Scheduling ProblemsSIAM Journal on Computing, 1994
- Batching and Scheduling in FMS Hubs: Flow Time ConsiderationsOperations Research, 1993
- V-shop schedulingEuropean Journal of Operational Research, 1984
- Flowshop and Jobshop Schedules: Complexity and ApproximationOperations Research, 1978
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954