Multi-family scheduling in a two-machine reentrant flow shop with setups

European Journal of Operational Research

Volumn 187, Issue 3, 2008, Pages 1160-1170

  Yang, Dar Li ^a   Kuo, Wen Hung ^a   Chern, Maw Sheng ^b  

^a National Formosa University Yun Lin   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Branch and bound; NP hard; Reentrant production flows; Scheduling; Setup time

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; COMPUTATIONAL METHODS; MACHINERY; PROBLEM SOLVING; PRODUCTION CONTROL;

NUMERICAL CONTROLLED MACHINES; REENTRANT PRODUCTION FLOWS; SETUP TIME;

SCHEDULING;

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

References (22)

1. A. Allahverdi, C.T. Ng, T.C.E. Cheng, M.Y. Kovalyov, A survey of scheduling problems with setup times or costs. European Journal of Operational Research, in press, doi:10.1016/j.ejor.2006.06.060.
2. Baker K.R. Scheduling groups of jobs in the two-machine flow shop. Mathematical and Computer Modelling 13 (1990) 29-36
3. Cetinkaya F.C., and Kayaligil M.S. Unit sized transfer family scheduling with setup times. Computers and Industrial Engineering 22 (1992) 177-183
4. M.S. Chern, D.L. Yang, A two-machine scheduling problem with reprocessing operations, in: The 5th International Congress on Computational and Applied Mathematics, Belgium, 1992.
5. Drobouchevitch I.G., and Giordani V.A. A heuristic algorithm for two-machine re-entrant shop scheduling. Annals of Operations Research 86 (1999) 417-439
6. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco
7. Gurnani H., Anupindi R., and Akella R. Control of family processing systems in semiconductor wafer fabrication facilities. IEEE Transactions on Semiconductor Manufacturing 5 (1992) 319-327
8. Horowitz E., and Sahni S. Fundamentals of Computer Algorithms (1978), Computer Science Press, Inc.
9. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
10. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
11. Lev V., and Adiri I. V-Shop scheduling. European Journal of Operational Research 18 (1984) 51-56
12. Mitten L.G. Sequencing n jobs on two machines with arbitrary time lags. Management Science 5 (1958) 293-298
13. In: Moss S.J., and Ledwith A. (Eds). The Chemistry of the Semiconductor Industry (1987), Chapman and Hall, New York
14. Pan J.C.-H., and Chen J.-S. Minimizing makespan in reentrant permutation flow-shops. Journal of Operational Research Society 57 (2003) 642-653
15. Rinnooy Kan A.H.G. Machine Scheduling Problems: Classification, Complexity and Computations (1976), Nijhoff, The Hague, Holland
16. Sekiguchi Y. Optimal schedule in a GT-type flow-shop under series-parallel precedence constraints. Journal of Operations Research Society of Japan 26 (1983) 226-251
17. Sule D.R., and Huang K.Y. Sequency on two and three machines with setup, processing and removal times separated. International Journal of Production Research 21 (1983) 723-732
18. Tomescu I. Introduction to Combinatiorics. (Translated from Romanian by I. Tomescu and S. Rudeanu) (1975), Collet's Publishers Ltd., London, Wellingborough
19. Vickson R.G., and Alfredsson B.E. Two- and three-machine flow shop scheduling problems with equal sized transfer families. International Journal of Production Research 30 (1992) 1551-1574
20. Wang M.Y., Sethi S.P., and Van De Velde S.L. Minimizing makespan in a class of reentrant shops. Operations Research 45 (1997) 702-712
21. Yang D.L., and Chern M.S. A scheduling problem with reprocessing operations - a case study. Journal of Management 14 (1997) 135-154
22. Yang D.L., and Chern M.S. Two-machine flowshop group scheduling problem. Computers and Operations Research 27 (2000) 975-985