Hybrid tabu search for re-entrant permutation flow-shop scheduling problem

Expert Systems with Applications

Volumn 34, Issue 3, 2008, Pages 1924-1930

  Chen, Jen Shiang ^a   Pan, Jason Chao Hsien ^b   Wu, Chien Kuang ^b  

^a FAR EAST UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Hybrid tabu search; Makespan; Re entrant permutation flow shop; Scheduling

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; JOB ANALYSIS; PROBLEM SOLVING; SCHEDULING; TABU SEARCH;

HYBRID TABU SEARCH; MAKESPAN OF JOBS; RE-ENTRANT PERMUTATION FLOW-SHOP;

MACHINE SHOPS;

EID: 37349113923     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2007.02.027     Document Type: Article

References (29)

1. Adams J., Balas E., and Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science 34 3 (1988) 391-401
2. Baker K.R. Introduction to Sequencing and Scheduling (1974), John Wiley & Sons, New York
3. Beasly J.E. OR-library: Distribution test problems by electronic mail. Journal of the Operational Research Society 41 11 (1990) 1069-1072
4. Bispo C.F., and Tayur S. Managing simple re-entrant flow lines: theoretical foundation and experimental results. IIE Transactions 33 8 (2001) 609-623
5. Campbell H.G., Dudek R.A., and Smith M.L. A heuristic algorithm for the n job, m machine sequencing problem. Management Science 16 10 (1970)
6. Coffman E.G. Computer and Job Shop Scheduling (1976), Wiley, New York
7. Dannenbring D.G. An evaluation of flow shop sequencing heuristics. Management Science 23 11 (1977) 1174-1182
8. Dell'Amico M., and Trubian M. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research 41 3 (1993) 231-252
9. Demirkol E., and Uzsoy R. Decomposition methods for reentrant flow shops with sequence-dependent setup times. Journal of Scheduling 3 3 (2000) 155-177
10. Drobouchevitch I.G., and Strusevich V.A. A heuristic algorithm for two-machine re-entrant shop scheduling. Annals of Operations Research 86 (1999) 417-439
11. Garey M.R., Johnson D.S., and Sethi R. The complexity of flow shop and job shop scheduling. Mathematics of Operations Research 1 (1976) 117-129
12. Glover F. Tabu search - Part I. ORSA Journal on Computing 1 (1989) 190-206
13. Glover F., and Languna M. In: Reeves C.R. (Ed). Tabu Search (1997), Blackwell Scientific Publications, Oxford
14. Graves S.C., Meal H.C., Stefek D., and Zeghmi A.H. Scheduling of reentrant flow shops. Journal of Operations Management 3 (1983) 197-207
15. Hwang, J., Kang, C. S., Ryu, K. R., Han, Y., & Choi, H. R. (2002). A hybrid of tabu search and integer programming for subway crew paring optimization. In Proceedings of the sixth IASTED international conference on artificial intelligence and soft computing (ASC-2002) (pp. 72-77). Canada: Banff.
16. Hwang H., and Sun J.U. Production sequencing problem with re-entrant work flows and sequence dependent setup times. International Journal of Production Research 36 (1998) 2435-2450
17. Johnson S.M. Optimal two- and three-stage production schedules with set up times included. Naval Research Logistics Quarterly 1 1 (1954) 61-68
18. Kubiak W., Lou S.X.C., and Wang Y. Mean flow time minimization in re-entrant job-shops with a hub. Operations Research 44 5 (1996) 764-776
19. Nawaz M., Enscore E.E., and Ham I. A heuristic algorithm for the m-machine n-job flow-shop sequencing problem. OMEGA 11 1 (1983) 91-95
20. Nowicki E., and Smutnicki C. A fast taboo search algorithm for the job shop problem. Management Science 42 6 (1996) 797-813
21. Nowicki E., and Smutnicki C. A fast taboo search algorithm for the permutation flow-shop problem. European Journal of Operational Research 91 1 (1996) 160-175
22. Nowicki E., and Smutnicki C. Flow shop with parallel machines: A tabu search approach. European Journal of Operational Research 106 2-3 (1998) 226-253
23. Palmer D.S. Sequencing jobs through a multi-stage process in the minimum total time - A quick method of obtaining a near optimum. Operational Research Quarterly 16 1 (1965) 101-107
24. Pan J.C.H., and Chen J.S. Minimizing makespan in re-entrant permutation flow-shops. Journal of the Operational Research Society 54 6 (2003) 642-653
25. Rinnooy Kan A.H.G. Machine Scheduling Problems: Classification Complexity and Computations (1976), Martinus Nijhoff, The Hague, Holland
26. Taillard, E. (1989). Parallel taboo search technique for the job shop scheduling problem. Internal Report ORWP89/11, Department de Mathematiques, Lausanne: Ecole Polytechnique Federale de Lausanne.
27. Vargas-Villamil F.D., and Rivera D.E. A model predictive control approach for real-time optimization of reentrant manufacturing lines. Computers in Industry 45 (2001) 45-57
28. Wang M.Y., Sethi S.P., and Van De Velde S.L. Minimizing makespan in a class of re-entrant shops. Operations Research 45 5 (1997) 702-712
29. Widmer M., and Hertz A. A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research 41 (1989) 186-193