Skip to main content
SpringerLink
Log in

Minimizing makespan in reentrant flow-shops using hybrid tabu search

  • Original article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This study considers the problem of reentrant flow-shop (RFS) scheduling, and applies hybrid tabu search (HTS) to minimize the makespan of jobs. The hybridization method is used to enhance the performance of pure tabu search. The HTS is compared to the optimal solutions generated by the integer programming technique, and to the near optimal solutions generated by pure tabu search and the non-delay schedule generation procedure. Computational experiments are performed to illustrate the effectiveness and efficiency of the proposed HTS algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34:391–401

    MATH  MathSciNet  Google Scholar 

  2. Aiex RM, Binato S, Resende MGC (2003) Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput 29:393–430

    Article  MathSciNet  Google Scholar 

  3. Beasly JE (1990) OR-library: distribution test problems by electronic mail. J Oper Res Soc 41:1069–1072

    Article  Google Scholar 

  4. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n job, m machine sequencing problem. Manag Sci 16:B630–B637

    Google Scholar 

  5. Dell’Amico M, Trubian M (1993) Applying tabu search to the job-shop scheduling problem. Ann Oper Res 41:231–252

    Article  MATH  Google Scholar 

  6. Demirkol E, Uzsoy R (2000) Decomposition methods for reentrant flow shops with sequence-dependent setup times. J Scheduling 3:155–177

    Article  MATH  MathSciNet  Google Scholar 

  7. Drobouchevitch IG, Strusevich VA (1999) A heuristic algorithm for two-machine re-entrant shop scheduling. Ann Oper Res 86:417–439

    Article  MATH  MathSciNet  Google Scholar 

  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

    Article  MATH  Google Scholar 

  9. Garey MR, Johnson DS, Sethi R (1976) The complexity of flow shop and job shop scheduling. Math Oper Res 1:117–129

    MATH  MathSciNet  Google Scholar 

  10. Glover F (1989) Tabu search—part I. ORSA J Computing 1:190–206

    MATH  MathSciNet  Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  MATH  Google Scholar 

  15. Johnson SM (1954) Optimal two- and three-stage production schedules with set up times included. Nav Res Logistics Q 1:61–68

    Article  Google Scholar 

  16. Kubiak W, Lou SXC, Wang Y (1996) Mean flow time minimization in reentrant job-shops with a hub. Oper Res 44:764–776

    MATH  Google Scholar 

  17. Mönch L, Drieβel R (2005) A distributed shifting bottleneck heuristic for complex job shops. Comput Ind Eng 49:363–380

    Article  Google Scholar 

  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

    Article  Google Scholar 

  19. Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manag Sci 42:797–813

    Article  MATH  Google Scholar 

  20. Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the permutation flow-shop problem. Eur J Oper Res 91:160–175

    Article  MATH  Google Scholar 

  21. Nowicki E, Smutnicki C (1998) Flow shop with parallel machines: a tabu search approach. Eur J Oper Res 106:226-253

    Article  MATH  Google Scholar 

  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

    Google Scholar 

  23. Pan JCH, Chen JS (2003) Minimizing makespan in reentrant permutation flow-shops. J Oper Res Soc 54:642–653

    Article  MATH  Google Scholar 

  24. Pan JCH, Chen JS (2004) A comparative study of schedule-generation procedures for the reentrant shops. Int J Ind Eng 11:313–321

    Google Scholar 

  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

    Article  Google Scholar 

  26. Pinedo M (2002) Scheduling: theory, algorithms, and systems. Prentice-Hall, New Jersey

    MATH  Google Scholar 

  27. Ríos-Mercado RZ, Bard JF (1998) Heuristics for the flow line problem with setup costs. Eur J Oper Res 110:76–98

    Article  MATH  Google Scholar 

  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

    Article  Google Scholar 

  30. Wang MY, Sethi SP, Van De Velde SL (1997) Minimizing makespan in a class of reentrant shops. Oper Res 45:702–712

    MATH  Google Scholar 

  31. Widmer M, Hertz A (1989) A new heuristic method for the flow shop sequencing problem. Eur J Oper Res 41:186–193

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Business Management, Far East College, 49 Junghua Road, Shinshr Shiang, Tainan, 744, Taiwan, Republic of China

    Jen-Shiang Chen

  2. Department of Industrial Management, National Taiwan University of Science and Technology, Taiwan, Republic of China

    Jason Chao-Hsien Pan & Chien-Kuang Wu

Authors
  1. Jen-Shiang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jason Chao-Hsien Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chien-Kuang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jen-Shiang Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, JS., Pan, J.CH. & Wu, CK. Minimizing makespan in reentrant flow-shops using hybrid tabu search. Int J Adv Manuf Technol 34, 353–361 (2007). https://doi.org/10.1007/s00170-006-0607-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-006-0607-2

Keywords

Search

Navigation