Minimizing makespan in reentrant flow-shops using hybrid tabu search

International Journal of Advanced Manufacturing Technology

Volumn 34, Issue 3-4, 2007, Pages 353-361

  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; Reentrant flow shop; Scheduling

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; SCHEDULING ALGORITHMS;

HYBRID TABU SEARCH; MAKESPAN; REENTRANT FLOW-SHOP;

TABU SEARCH;

EID: 36048941732     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-006-0607-2     Document Type: Article

References (31)

1. Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34:391-401
2. Aiex RM, Binato S, Resende MGC (2003) Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput 29:393-430
3. Beasly JE (1990) OR-library: distribution test problems by electronic mail. J Oper Res Soc 41:1069-1072
4. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n job, m machine sequencing problem. Manag Sci 16:B630-B637
5. Dell'Amico M, Trubian M (1993) Applying tabu search to the job-shop scheduling problem. Ann Oper Res 41:231-252
6. Demirkol E, Uzsoy R (2000) Decomposition methods for reentrant flow shops with sequence-dependent setup times. J Scheduling 3:155-177
7. Drobouchevitch IG, Strusevich VA (1999) A heuristic algorithm for two-machine re-entrant shop scheduling. Ann Oper Res 86:417-439
8. Feo TA, Sarathy K, McGahan J (1996) A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties. Comput Ops Res 23:881-895
9. Garey MR, Johnson DS, Sethi R (1976) The complexity of flow shop and job shop scheduling. Math Oper Res 1:117-129
10. Glover F (1989) Tabu search-part I. ORSA J Computing 1:190-206
11. Glover F, Languna M (1993) Tabu search-modern heuristic techniques for combinatorial problems. Reeves CR (ed), Blackwell Scientific, Oxford, pp 70-150
12. Glover F, Languna M (1997) Tabu search. Reeves CR (ed), Blackwell Scientific, Oxford
13. Graves SC, Meal HC, Stefek D, Zeghmi AH (1983) Scheduling of reentrant flow shops. J Oper Manag 3:197-207
14. Hwang H, Sun JU (1998) Production sequencing problem with re-entrant work flows and sequence dependent setup times. Int J Prod Res 36:2435-2450
15. Johnson SM (1954) Optimal two- and three-stage production schedules with set up times included. Nav Res Logistics Q 1:61-68
16. Kubiak W, Lou SXC, Wang Y (1996) Mean flow time minimization in reentrant job-shops with a hub. Oper Res 44:764-776
17. Mönch L, Drieβel R (2005) A distributed shifting bottleneck heuristic for complex job shops. Comput Ind Eng 49:363-380
18. Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine n-job flow-shop sequencing problem. OMEGA 11:91-95
19. Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manag Sci 42:797-813
20. Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the permutation flow-shop problem. Eur J Oper Res 91:160-175
21. Nowicki E, Smutnicki C (1998) Flow shop with parallel machines: a tabu search approach. Eur J Oper Res 106:226-253
22. Palmer DS (1965) Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. Oper Res Q 16:101-107
23. Pan JCH, Chen JS (2003) Minimizing makespan in reentrant permutation flow-shops. J Oper Res Soc 54:642-653
24. Pan JCH, Chen JS (2004) A comparative study of schedule-generation procedures for the reentrant shops. Int J Ind Eng 11:313-321
25. Pearn WL, Chung SH, Chen AY, Yang MH (2004) A case study on the multistage IC final testing scheduling problem with reentry. Int J Prod Econ 88:257-267
26. Pinedo M (2002) Scheduling: theory, algorithms, and systems. Prentice-Hall, New Jersey
27. Ríos-Mercado RZ, Bard JF (1998) Heuristics for the flow line problem with setup costs. Eur J Oper Res 110:76-98
28. Taillard E (1989) Parallel taboo search technique for the job shop scheduling problem. Internal Report ORWP89/11, Department de Mathematiques, Ecole Polytechnique Federale de Lausanne, Lausanne
29. Uzsoy R, Lee CY, Martin-Vega LA (1992) A review of production planning and scheduling models in the semiconductor industry, part 1: system characteristics, performance evaluation and production planning. IIE Trans 24:47-60
30. Wang MY, Sethi SP, Van De Velde SL (1997) Minimizing makespan in a class of reentrant shops. Oper Res 45:702-712
31. Widmer M, Hertz A (1989) A new heuristic method for the flow shop sequencing problem. Eur J Oper Res 41:186-193