Approximation algorithms for the parallel flow shop problem

European Journal of Operational Research

Volumn 216, Issue 3, 2012, Pages 544-552

  Zhang, Xiandong ^a   Van De Velde, Steef ^b  

^a FUDAN UNIVERSITY   (China)

^b ERASMUS UNIVERSITY   (Netherlands)

Author keywords

Approximation algorithms; Hybrid flow shop; Parallel flow shop; Scheduling; Worst case analysis

Indexed keywords

FLOW-SHOPS; HYBRID FLOW SHOP; JOHNSON'S RULE; MAKESPAN; NP-HARD PROBLEM; PARALLEL FLOW SHOP; SUB-PROBLEMS; TWO STAGE; WORST-CASE ANALYSIS; WORST-CASE PERFORMANCE;

COMPUTATIONAL COMPLEXITY; MACHINE SHOP PRACTICE; PARALLEL FLOW; SCHEDULING; SCHEDULING ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 80053928166     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.08.007     Document Type: Article

References (17)

1. A. Al-Salem A heuristic to minimize makespan in proportional parallel flow shops International Journal of Computing & Information Sciences 2 2 2004 98
2. D. Cao, and M. Chen Parallel flowshop scheduling using Tabu search International Journal of Production Research 41 13 2003 3059 3073
3. Chen, B.; 1994. Scheduling multiprocessor flow shops. In: Du, D.-Z.; Sun, J. (Eds.), New Advances in Optimization and Approximation, pp. 1-8.
4. B. Chen Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage Journal of the Operational Research Society 1995 234 244
5. J. Gupta Two-stage, hybrid flowshop scheduling problem Journal of the Operational Research Society 1988 359 364 (Pubitemid 18621609)
6. J. Gupta, A. Hariri, and C. Potts Scheduling a two-stage hybrid flow shop with parallel machines at the first stage Annals of Operations Research 69 1997 171 191 (Pubitemid 127503103)
7. J. Gupta, and E. Tunc Schedules for a two-stage hybrid flowshop with parallel machines at the second stage International Journal of Production Research 29 7 1991 1489 1502 (Pubitemid 21649910)
8. J. Hoogeveen, J. Lenstra, and B. Veltman Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard European Journal of Operational Research 89 1 1996 172 175 (Pubitemid 126386771)
9. S. Johnson Optimal two-and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1 1954
10. C. Lee, and G. Vairaktarakis Minimizing makespan in hybrid flowshops Operations Research Letters 16 3 1994 149 158
11. R. Linn, and W. Zhang Hybrid flow shop scheduling: A survey Computers & industrial engineering 37 1-2 1999 57 61
12. B. Naderi, R. Ruiz, and M. Zandieh Algorithms for a realistic variant of flowshop scheduling Computers & Operations Research 37 2 2010 236 246
13. Qi, X.; 2008. New results for scheduling two flowlines. Working paper of Hong Kong University of Science and Technology.
14. I. Ribas, R. Leisten, and J. Framiñan Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective Computers & Operations Research 37 8 2010 1439 1454
15. R. Ruiz, and J. Vazquez-Rodriguez The hybrid flow shop scheduling problem European Journal of Operational Research 205 1 2010 1 18
16. G. Vairaktarakis, and M. Elhafsi The use of flowlines to simplify routing complexity in two-stage flowshops IIE Transactions 32 8 2000 687 699
17. H. Wang Flexible flow shop scheduling: Optimum, heuristics and artificial intelligence solutions Expert Systems 22 2 2005 78 85 (Pubitemid 43906636)