Scheduling algorithms for flexible flowshops: Worst and average case performance

European Journal of Operational Research

Volumn 43, Issue 2, 1989, Pages 143-160

  Sriskandarajah, C ^a   Sethi, S P ^b  

^a GERAD   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Flexible flowshop; heuristic algorithms; performance bounds; scheduling; worst case analysis

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; INDUSTRIAL PLANTS--FLEXIBLE MANUFACTURING SYSTEMS;

FLEXIBLE FLOWSHOP; HEURISTIC ALGORITHMS; PERFORMANCE BOUNDS; WORST CASE ANALYSIS;

SCHEDULING;

EID: 0024769054     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(89)90208-7     Document Type: Article

References (25)

1. On some problems of sequencing and grouping
2. An Application of Bin-Packing to Multiprocessor Scheduling
3. An evaluation of flowshop sequencing heuristics
4. Tighter bounds for multifit processor scheduling algorithm
5. Evaluation of a multifit-based scheduling algorithm
6. The complexity of flowshop and jobshop scheduling
7. Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
8. Flowshop and jobshop schedules: Complexity and approximation
9. Bounds for Certain Multiprocessing Anomalies
10. Bounds on Multiprocessing Timing Anomalies
11. Using dual approximation algorithms for scheduling problems: Theoretical and practical results
12. Optimal two- and three-stage production schedules with setup times included
13. Improved LPT scheduling for identical processor systems
14. Interstage transportation planning in the deterministic flowshop environment
15. Recent developments in deterministic sequencing and scheduling: A survey
16. A survey and evaluation of static flowshop scheduling heuristics
17. Three machine no-wait flowshop: Complexity and approximation
18. The Three-Machine No-Wait Flow Shop is NP-Complete
19. Machine aggregation heuristics in shop scheduling
20. A solution of a special class of flowshop scheduling problems
21. Heuristic Flow-Shop Scheduling to Minimize Sum of Job Completion Times
22. L'ordonnancement dans les ateliers: Complexité et algorithmes heuristiques
23. Some no-wait shops scheduling problems: Complexity Aspects
24. An adaptable scheduling algorithm for flexible flow lines