A Hybrid Algorithm for Job Shop Scheduling Problem

  • Xinyu LiEmail author
  • Liang Gao
Part of the Engineering Applications of Computational Methods book series (EACM, volume 2)


Job shop Scheduling Problem (JSP) which is widespread in the real-world production system is one of the most general and important problems in various scheduling problems. Nowadays, the effective method for JSP is a hot topic in the research area of the manufacturing system. JSP is a typical NP-hard combinatorial optimization problem and has a broad engineering application background. Due to the large and complicated solution space and process constraints, JSP is very difficult to find an optimal solution within a reasonable time even for small instances. In this chapter, a hybrid Particle Swarm Optimization algorithm (PSO) based on Variable Neighborhood Search (VNS) has been proposed to solve this problem. In order to overcome the blind selection of neighborhood structures during the hybrid algorithm design, a new neighborhood structure evaluation method based on logistic model has been developed to guide the neighborhood structures selection. This method is utilized to evaluate the performance of different neighborhood structures. Then the neighborhood structures which have good performance are selected as the main neighborhood structures in VNS. Finally, a set of benchmark instances has been conducted to evaluate the performance of the proposed hybrid algorithm and the comparisons among some other state-of-the-art reported algorithms are also presented. The experimental results show that the proposed hybrid algorithm has achieved good improvement in the optimization of JSP, which also verifies the effectiveness and efficiency of the proposed neighborhood structure evaluation method.


Job shop scheduling problem Neighborhood structure evaluation Logistic model Hybrid algorithm 


  1. 1.
    Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manage Sci 42:797–813zbMATHCrossRefGoogle Scholar
  2. 2.
    Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Ope Res 1:117–129MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Adams J, Egon B, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34:391–401MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Asadzadeh L, Zamanifar K (2010) An agent-based parallel approach for the job shop scheduling problem with genetic algorithms. Mathematic Comput Modell 52:1957–1965zbMATHCrossRefGoogle Scholar
  5. 5.
    Yusof R, Khalid M, Hui GT, Yusof SM, Othman MF (2011) Solving job shop scheduling problem using a hybrid parallel micro genetic algorithm. Appl Soft Comput 11:5782–5792CrossRefGoogle Scholar
  6. 6.
    Sels V, Craeymeersch K, Vanhoucke M (2011) A hybrid single and dual population search procedure for the job shop scheduling problem. Eur J Operat Res 215:512–523MathSciNetCrossRefGoogle Scholar
  7. 7.
    Zhang R, Song S, Wu C (2013) A hybrid artificial bee colony algorithm for the job shop scheduling problem. Int J Product Eco 141:167–178CrossRefGoogle Scholar
  8. 8.
    Wang X, Duan H (2014) A hybrid biogeography-based optimization algorithm for job shop scheduling problem. Comput Ind Eng 73:96–114CrossRefGoogle Scholar
  9. 9.
    Nasad MK, Modarres M, Seyedhoseini SM (2015) A self-adaptive PSO for joint lot sizing and job shop scheduling with compressible process times. Appl Soft Comput 27:137–147CrossRefGoogle Scholar
  10. 10.
    Baykasoglu A, Hamzadayi A, Kose SY (2014) Testing the performance of teaching-learning based optimization (TLBO) algorithm on combinatorial problems: flow shop and job shop scheduling cases. Inf Sci 276:204–218MathSciNetCrossRefGoogle Scholar
  11. 11.
    Lei D, Guo X (2015) An effective neighborhood search for scheduling in dual-resource constrained interval job shop with environmental objective. Int J Produc Eco 159:296–303CrossRefGoogle Scholar
  12. 12.
    Peng B, Lu Z, Cheng TCE (2015) A tabu search/path relinking algorithm to solve the job shop scheduling problem. Comput Oper Res 53:154–164MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Goncalves JF, Mendes JJ, Resende MGC (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res 167(1):77–95MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Zhang CY, Li PG, Rao YQ, Li S (2005) A new hybrid GA/SA algorithm for the job shop scheduling problem. Lecture Notes in Computer Science, 246–259Google Scholar
  15. 15.
    Zhang CY, Li PG, Rao YQ, Guan ZL (2008) A very fast TS/SA algorithm for the job shop scheduling problem. Comput Operat Res 35(1):282–294zbMATHCrossRefGoogle Scholar
  16. 16.
    Ge H, Sun L, Liang Y, Qian F (2008) An effective PSO and AIS-based hybrid intelligent algorithm for job-shop scheduling. IEEE Trans Sys Man Cyber Part A: Sys Humans 38(2):358–368CrossRefGoogle Scholar
  17. 17.
    Gao L, Zhang GH, Zhang LP, Li XY (2011) An efficient memetic algorithm for solving the job shop scheduling problem. Comput Ind Eng 60:699–705CrossRefGoogle Scholar
  18. 18.
    Eswaramurthy VP, Tamilarasi A (2009) Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems. Int J Adv Manufac Technol 40:1004–1015zbMATHCrossRefGoogle Scholar
  19. 19.
    Zuo X, Wang C, Tan W (2012) Two heads are better than one: an AIS- and TS- based hybrid strategy for job shop scheduling problems. Int J Adv Manufac Technol 63:155–168CrossRefGoogle Scholar
  20. 20.
    Ren Q, Wang Y (2012) A new hybrid genetic algorithm for job shop scheduling problem. Comput Oper Res 39:2291–2299MathSciNetzbMATHCrossRefGoogle Scholar
  21. 21.
    Nasiri MM, Kianfar FA (2012) GES/TS algorithm for the job shop scheduling. Comput Ind Eng 62:946–952CrossRefGoogle Scholar
  22. 22.
    Ponsich A, Coello CAC (2013) A hybrid differential evolution—Tabu search algorithm for the solution of job shop scheduling problems. Appl Soft Comput 13:462–474CrossRefGoogle Scholar
  23. 23.
    Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neutral networks, Australia, Perth (pp 1942–1948)Google Scholar
  24. 24.
    Schutte JF, Reinbolt JA, Fregly BJ, Haftka RT, George AD (2004) Parallel global optimization with the particle swarm algorithm. Int J Num Methods Eng 61(13):2296–2315zbMATHCrossRefGoogle Scholar
  25. 25.
    Vassiliadis V, Dounias G (2009) Nature-inspired intelligence: a review of selected methods and applications. Int J Art Int Tools 18(4):487–516CrossRefGoogle Scholar
  26. 26.
    Wang K, Huang L, Zhou C, Pang W (2003) Particle swarm optimization for traveling salesman problem. In: Proceedings of international conference on machine learning and cybernetics (pp 1583–1585)Google Scholar
  27. 27.
    Gao L, Peng CY, Zhou C, Li PG (2006) Solving flexible job-shop scheduling problem using general particle swarm optimization. In The 36th CIE conference on computers industrial engineering (pp 3018–3027)Google Scholar
  28. 28.
    Niknam T, Amiri B, Olamaei J, Arefi A (2009) An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering (pp 512–519). Zhejiang University Press, SpringerGoogle Scholar
  29. 29.
    Pongchairerks P, Kachitvichyanukul V (2009) A two-level particle swarm optimization algorithm on job-shop scheduling problems. Int J Oper Res 4:390–411zbMATHCrossRefGoogle Scholar
  30. 30.
    Sha DY, Hsu C (2006) A hybrid particle swarm optimization for job shop scheduling problem. Comput Ind Eng 51:791–808CrossRefGoogle Scholar
  31. 31.
    Xia W, Wu Z (2006) A hybrid particle swarm optimization approach for the job shop scheduling problem. Int J Adv Manufac Technol 29:360–366CrossRefGoogle Scholar
  32. 32.
    Caporossi G, Hansen P (2000) Variable neighborhood search for extremal graphs: 1 the AutoGraphiX system. Dis Math 212(1–2):29–44MathSciNetzbMATHCrossRefGoogle Scholar
  33. 33.
    Felipe A, Ortuno MT, Tirado G (2009) The double traveling salesman problem with multiple stacks: A variable neighborhood search approach. Comput Operat Res 36(11):2983–2993MathSciNetzbMATHCrossRefGoogle Scholar
  34. 34.
    Kuo Y, Wang C (2012) A variable neighborhood search for the multi-depot vehicle routing problem with loading cost. Exp Sys App 39(8):6949–6954CrossRefGoogle Scholar
  35. 35.
    Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097–1100MathSciNetzbMATHCrossRefGoogle Scholar
  36. 36.
    Bagheri A, Zandieh M (2011) Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—Variable neighborhood search approach. J Manufac Sys 30(1):8–15CrossRefGoogle Scholar
  37. 37.
    Mehmet S, Aydin ME (2006) A variable neighbourhood search algorithm for job shop scheduling problems. Lecture Notes in Computer Science, 261–271Google Scholar
  38. 38.
    Yazdani M, Amiri M, Zandieh M (2010) Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Exp Sys Appl 37(1):678–687zbMATHCrossRefGoogle Scholar
  39. 39.
    Shi Y, Liu HC, Gao L, Zhang GH (2011) Cellular particle swarm optimization. Inf Sci 181(20):4460–4493MathSciNetzbMATHCrossRefGoogle Scholar
  40. 40.
    Fang HL, Ross P, Corne D (1993) A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems. In Proceedings of the fifth international conference on genetic algorithms, 1993 (pp 375–382). San Mateo, California: Morgan Kaufmann PublishersGoogle Scholar
  41. 41.
    Zhang CY, Rao YQ, Li PG (2008) An effective hybrid genetic algorithm for the job shop scheduling problem. Int J Adv Manufac Technol 39:965–974CrossRefGoogle Scholar
  42. 42.
    Falkenauer E, Bouffouix S (1991) A genetic algorithm for job shop. In: The proceedings of the IEEE international conference on robotics and automation, Sacremento, California (pp 824–829)Google Scholar
  43. 43.
    Kauffman SA, Strohman RC (1994) The origins of order: Self-organization and selection in evolution. Int Physiol Behav Sci 29(2):193–194Google Scholar
  44. 44.
    Bierwirth C, Mattfeld D, Watson JP (2004) Landscape regularity and random walks for the job-shop scheduling problem. Evol Comput Combin Opt, 21–30Google Scholar
  45. 45.
    Darwen PJ (2001) Looking for the big valley in the fitness landscape of single machine scheduling with batching, precedence constraints, and sequence- dependent setup times. In Proceedings of the fifth Australasia–Japan joint workshop (pp 19–21)Google Scholar
  46. 46.
    Manderick B, Weger MD, Spiessens P (1991) The genetic algorithms and the structure of the fitness landscape. In: Proceedings of the fourth international conference on genetic algorithms, San Mateo (pp 143–150)Google Scholar
  47. 47.
    Smith-Miles K, James R, Giffin J, Tu Y (2009) A knowledge discovery approach to understanding relationships between scheduling problem structure and heuristic performance. Lecture Notes in Computer Science, 89–103Google Scholar
  48. 48.
    Watson J (2010) An introduction to fitness landscape analysis and cost models for local search. International Series in Operations Research and Management Science, 599–623Google Scholar
  49. 49.
    Watson JP, Beck JC, Howe AE, Whitley LD (2003) Problem difficulty for tabu search in job-shop scheduling. Art Int 143(2):189–217MathSciNetzbMATHCrossRefGoogle Scholar
  50. 50.
    Wen F, Gao L, Li XY (2011) A logistic model for solution space of job shop scheduling problem. Int J Adv Comput Technol 3(9):236–245Google Scholar
  51. 51.
    Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Operat Res Soc 41(11):1069–1072CrossRefGoogle Scholar
  52. 52.
    Lin T, Horng S, Kao T, Chen Y, Run R, Chen R, Kuo I (2010) An efficient job- shop scheduling algorithm based on particle swarm optimization. Exp Sys App 37(3):2629–2636CrossRefGoogle Scholar
  53. 53.
    Aiex RM, Binato S, Resende MGC (2003) Parallel GRASP with path-relinking for job shop scheduling. Par Comput 29:393–430MathSciNetCrossRefGoogle Scholar
  54. 54.
    Pezzella F, Merelli EA (2000) Tabu search method guided by shifting bottleneck for the job shop scheduling problem. Eur J Oper Res 120:297–310MathSciNetzbMATHCrossRefGoogle Scholar
  55. 55.
    Cheng R (1997) A study on genetic algorithms-based optimal scheduling techniques. PhD thesis. Tokyo Institute of TechnologyGoogle Scholar
  56. 56.
    Park BJ, Choi HR, Kim HS (2003) A hybrid genetic algorithm for the job shop scheduling problems. Comput Ind Eng 45:597–613CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature and Science Press, Beijing 2020

Authors and Affiliations

  1. 1.School of Mechanical Science and Engineering, HUSTState Key Laboratory of Digital Manufacturing and Equipment TechnologyWuhanChina
  2. 2.School of Mechanical Science and Engineering, HUSTState Key Laboratory of Digital Manufacturing and Equipment TechnologyWuhanChina

Personalised recommendations