Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints

Computers and Mathematics with Applications

Volumn 50, Issue 10-12, 2005, Pages 1629-1638

  Xie, Jinxing ^a   Wang, Xijun ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Approximability; Approximation algorithms; Availability constraints; Flexible flowshop; Scheduling; Worst case analysis

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; SCHEDULING;

APPROXIMABILITY; APPROXIMATION ALGORITHMS; AVAILABILITY CONSTRAINTS; FLEXIBLE FLOWSHOP; WORST-CASE ANALYSIS;

CONSTRAINT THEORY;

EID: 28844491706     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2005.07.008     Document Type: Article

References (21)

1. M.S. Salvador A solution to a special case of flow shop scheduling problems S.E. Elmaghraby Symposium on the Theory of Scheduling and Its Applications 1973 Springer-Verlag Boston, MA
2. J.A. Hoogeveen, J.K. Lenstra, and B. Veltman Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard European Journal of Operational Research 89 1996 172 175
3. R.J. Wittrock An adaptive scheduling algorithm for flexible flow lines Operations Research 36 1988 445 453
4. C. Sriskandarajah, and S.P. Sethi Scheduling algorithms for flexible flowshops: Worst and average case performance European Journal of Operational Research 43 1989 143 160
5. 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 46 1995 234 244
6. L.A. Hall Approximability of flow shop scheduling Mathematical Programming 82 1998 175 190
7. P. Schuurman, and G.J. Woeginger A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem Theoretical Computer Science 237 2000 105 122
8. M.E. Kurz, and A.G. Ronald Comparing scheduling rules for flexible flow lines International Journal of Production Economics 85 2003 371 388
9. M.E. Kurz, and A.G. Ronald Scheduling flexible flow lines with sequence-dependent setup times European Journal of Operational Research 159 2004 66 82
10. C.Y. Lee Two-machine flowshop scheduling with availability constraints European Journal of Operational Research 114 1999 420 429
11. I. Adiri, J. Bruno, E. Frostig, and A.H.G. Rinnooy Kan Single machine flow-time scheduling with a single breakdown Acta Informatica 26 1989 679 696
12. G. Schmidt Scheduling on semi-identical processors Zeitschrift für Operations Research 28 1984 153 162
13. H.C. Hwang, and S.Y. Chang Parallel machines scheduling with machine shutdowns Computers Math. Applic. 36 1998 21 31
14. C.Y. Lee Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint Operations Research Letters 20 1997 129 139
15. W. Kubiak, J. Blazewicz, P. Formanowicz, J. Breit, and G. Schmidt Two machine flow shops with limited machine availability European Journal of Operational Research 136 2002 528 540
16. J. Blazewicz, J. Breit, P. Formanowicz, W. Kubiak, and G. Schmidt Heuristic algorithms for the two-machine flowshop with limited machine availability Omega 29 2001 599 608
17. M.L. Espinouse, P. Formanowicz, and B. Penz Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability Journal of the Operational Research Society 52 2001 116 121
18. X. Wang, and J. Xie Branch and bound algorithm for flexible flowshop with limited machine availability Asian Information-Science-Life 1 2002 241 248
19. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman Berlin
20. R.L. Graham Bounds for certain multiprocessing anomalies The Bell System Technical Journal 45 1966 1563 1581
21. T.C.E. Cheng, and G.Q. Wang Two-machine flowshop scheduling with consecutive availability constraints Information Processing Letters 71 1999 49 54