Scheduling algorithms for flexible flowshops: Worst and average case performance
- 27 November 1989
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 43 (2) , 143-160
- https://doi.org/10.1016/0377-2217(89)90208-7
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- 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
- Flowshop and Jobshop Schedules: Complexity and ApproximationOperations Research, 1978
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1964