Worst-case analysis of heuristics for open shops with parallel machines
Authors:
- Bo ChenBCBo Chen
- Vitaly A. StrusevichVSVitaly A. Strusevich
- 1 November 1993
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 70 (3) , 379-390
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Approximation Algorithms for Three-Machine Open Shop SchedulingINFORMS Journal on Computing, 1993
- Schedules for a two-stage hybrid flowshop with parallel machines at the second stageInternational Journal of Production Research, 1991
- Branch and bound algorithm for the flow shop with multiple processorsEuropean Journal of Operational Research, 1991
- Two-Stage, Hybrid Flowshop Scheduling ProblemJournal of the Operational Research Society, 1988
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- Evaluation of a MULTIFIT-based scheduling algorithmJournal of Algorithms, 1986
- Tighter Bounds for the Multifit Processor Scheduling AlgorithmSIAM Journal on Computing, 1984
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966