Skip to main content
SpringerLink
Log in

A guided tabu search/path relinking algorithm for the job shop problem

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

The job shop scheduling problem with makespan criterion is valuable from both practical and theoretical points of view. This problem has been attacked by most of the well-known meta-heuristic algorithms. Among them, tabu search has emerged as the most effective approach. The proposed algorithm takes advantages of both N1 and N6 neighborhoods. N1 neighborhood is used as a path relinking procedure while N6 neighborhood with its guideposts is applied in a tabu search framework. In addition, a method is presented for updating the topological order, heads and tails in N6 neighborhood. The algorithm is tested on standard benchmark sets, outperformed all previous approaches (include i-TSAB) and found six new upper bounds among the unsolved problems. Furthermore, we have tried to collect the newest upper bounds for the other problems.

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. Pinedo ML (2006) Planning and scheduling in manufacturing and services. Series in Operations Research and Financial Engineering. New York: Springer

  2. Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comp 3(2):149–156

    MATH  Google Scholar 

  3. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman

  4. Nasiri MM, Kianfar F (2011) A hybrid scatter search for the partial job shop scheduling problem. Int J Adv Manuf Tech 52(9):1031–1038

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  6. Blazewicz J, Domschke W, Pesch E (1996) The job shop scheduling problem: conventional and new solution techniques. Eur J Oper Res 93:1–33

    Article  MATH  Google Scholar 

  7. Balas E, Vazacopoulos A (1998) Guided local search with shifting bottleneck for job shop scheduling. Manage Sci 44(2):262–275

    Article  MATH  Google Scholar 

  8. Ponnambalam SG, Aravindan P, Rajesh SV (2000) A tabu search algorithm for job shop scheduling. Int J Adv Manuf Tech 16:765–771

    Article  Google Scholar 

  9. Pezzella F, Merelli E (2000) A tabu search method guided by shifting bottleneck for job shop scheduling problem. Eur J Oper Res 120:297–310

    Article  MathSciNet  MATH  Google Scholar 

  10. Nowicki E, Smutnicki C (2005) An advanced tabu search algorithm for the job shop problem. J Sched 8(2):145–159

    Article  MathSciNet  MATH  Google Scholar 

  11. Amirthagadeswaran KS, Arunachalam VP (2006) Improved solutions for job shop scheduling problems through genetic algorithm with a different method of schedule deduction. Int J Adv Manuf Tech 28:532–540

    Article  Google Scholar 

  12. Pardalos P, Shylo O (2006) An algorithm for the job shop scheduling problem based on global equilibrium search techniques. Comput Manage Sci 3:331–348

    Article  MathSciNet  MATH  Google Scholar 

  13. Zhang CY, Li PG, Guan ZL, Rao YQ (2007) A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput Oper Res 34:3229–3242

    Article  MathSciNet  MATH  Google Scholar 

  14. Zhang CY, Li PG, Rao YQ, Guan ZL (2008) A very fast TS/SA algorithm for the job shop scheduling problem. Comput Oper Res 35:282–294

    Article  MathSciNet  MATH  Google Scholar 

  15. Udomsakdigool A, Kachitvichyanukul V (2008) Multiple colony ant algorithm for job-shop scheduling problem. Int J Prod Res 46:4155–4175

    Article  MATH  Google Scholar 

  16. Huang KL, Liao CJ (2008) Ant colony optimization combined with taboo search for the job shop scheduling problem. Comput Oper Res 35:1030–1046

    Article  MathSciNet  MATH  Google Scholar 

  17. Wang YM, Yin HL, Wang J (2009) Genetic algorithm with new encoding scheme for job shop scheduling. Int J Adv Manuf Tech 44:977–984

    Article  Google Scholar 

  18. Eswaramurthy VP, Tamilarasi A (2009) Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems. Int J Adv Manuf Tech 40:1004–1015

    Article  Google Scholar 

  19. Rego C, Duarte R (2009) A filter-and-fan approach to the job shop scheduling problem. Eur J Oper Res 194:650–662

    Article  MATH  Google Scholar 

  20. Pardalos P, Shylo O, Vazacopoulos A (2010) Solving job shop scheduling problems utilizing the properties of backbone and “big valley”. Comput Optim Appl 47:61–76

    Article  MathSciNet  MATH  Google Scholar 

  21. Lin TL, Horng SJ, Kao TW et al (2010) An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst Appl 37:2629–2636

    Article  Google Scholar 

  22. Nasiri MM, Kianfar F (2011) A GA/TS algorithm for the stage shop scheduling problem. Comp Ind Eng 61(1):161–170

    Google Scholar 

  23. Beck JC, Feng TK, Watson JP (2011) Combining constraint programming and local search for job shop scheduling. INFORMS J Comp 23(1):1–14

    Article  MathSciNet  Google Scholar 

  24. Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Dordrecht

    Book  MATH  Google Scholar 

  25. Glover F, Taillard E, Werra D (1993) A user’s guide to tabu search. Ann Oper Res 41:3–28

    Article  MATH  Google Scholar 

  26. Kawai T, Fujimoto Y (2005) An efficient combination of dispatch rules for job-shop scheduling problem. Proceedings of 3rd International Conference on Industrial Informatics (INDIN) 484–488

  27. Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement). Graduate School of Industrial Administration. Carnegie-Mellon University, Pittsburgh, Pennsylvania

    Google Scholar 

  28. Taillard ED (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285

    Article  MATH  Google Scholar 

  29. Taillard ED. http://mistic.heig-vd.ch/taillard. Accessed on: April 2011

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran

    Mohammad Mahdi Nasiri & Farhad Kianfar

Authors
  1. Mohammad Mahdi Nasiri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Farhad Kianfar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammad Mahdi Nasiri.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nasiri, M.M., Kianfar, F. A guided tabu search/path relinking algorithm for the job shop problem. Int J Adv Manuf Technol 58, 1105–1113 (2012). https://doi.org/10.1007/s00170-011-3441-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3441-0

Keywords

Search

Navigation