Skip to main content
SpringerLink
Log in
Book cover

Effective Methods for Integrated Process Planning and Scheduling pp 107–131Cite as

A Hybrid Algorithm for Job Shop Scheduling Problem

  • Chapter
  • First Online:

  • 711 Accesses

Part of the book series: Engineering Applications of Computational Methods ((EACM,volume 2))

Abstract

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.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

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

    Article  MATH  Google Scholar 

  2. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Ope Res 1:117–129

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  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–1965

    Article  MATH  Google Scholar 

  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–5792

    Article  Google Scholar 

  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–523

    Article  MathSciNet  Google Scholar 

  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–178

    Article  Google Scholar 

  8. Wang X, Duan H (2014) A hybrid biogeography-based optimization algorithm for job shop scheduling problem. Comput Ind Eng 73:96–114

    Article  Google Scholar 

  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–147

    Article  Google Scholar 

  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–218

    Article  MathSciNet  Google Scholar 

  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–303

    Article  Google Scholar 

  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–164

    Article  MathSciNet  MATH  Google Scholar 

  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–95

    Article  MathSciNet  MATH  Google Scholar 

  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–259

    Google Scholar 

  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–294

    Article  MATH  Google Scholar 

  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–368

    Article  Google Scholar 

  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–705

    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 Manufac Technol 40:1004–1015

    Article  MATH  Google Scholar 

  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–168

    Article  Google Scholar 

  20. Ren Q, Wang Y (2012) A new hybrid genetic algorithm for job shop scheduling problem. Comput Oper Res 39:2291–2299

    Article  MathSciNet  MATH  Google Scholar 

  21. Nasiri MM, Kianfar FA (2012) GES/TS algorithm for the job shop scheduling. Comput Ind Eng 62:946–952

    Article  Google Scholar 

  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–474

    Article  Google Scholar 

  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. 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–2315

    Article  MATH  Google Scholar 

  25. Vassiliadis V, Dounias G (2009) Nature-inspired intelligence: a review of selected methods and applications. Int J Art Int Tools 18(4):487–516

    Article  Google Scholar 

  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. 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. 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, Springer

    Google Scholar 

  29. Pongchairerks P, Kachitvichyanukul V (2009) A two-level particle swarm optimization algorithm on job-shop scheduling problems. Int J Oper Res 4:390–411

    Article  MATH  Google Scholar 

  30. Sha DY, Hsu C (2006) A hybrid particle swarm optimization for job shop scheduling problem. Comput Ind Eng 51:791–808

    Article  Google Scholar 

  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–366

    Article  Google Scholar 

  32. Caporossi G, Hansen P (2000) Variable neighborhood search for extremal graphs: 1 the AutoGraphiX system. Dis Math 212(1–2):29–44

    Article  MathSciNet  MATH  Google Scholar 

  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–2993

    Article  MathSciNet  MATH  Google Scholar 

  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–6954

    Article  Google Scholar 

  35. Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097–1100

    Article  MathSciNet  MATH  Google Scholar 

  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–15

    Article  Google Scholar 

  37. Mehmet S, Aydin ME (2006) A variable neighbourhood search algorithm for job shop scheduling problems. Lecture Notes in Computer Science, 261–271

    Google Scholar 

  38. Yazdani M, Amiri M, Zandieh M (2010) Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Exp Sys Appl 37(1):678–687

    Article  MATH  Google Scholar 

  39. Shi Y, Liu HC, Gao L, Zhang GH (2011) Cellular particle swarm optimization. Inf Sci 181(20):4460–4493

    Article  MathSciNet  MATH  Google Scholar 

  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 Publishers

    Google Scholar 

  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–974

    Article  Google Scholar 

  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. Kauffman SA, Strohman RC (1994) The origins of order: Self-organization and selection in evolution. Int Physiol Behav Sci 29(2):193–194

    Google Scholar 

  44. Bierwirth C, Mattfeld D, Watson JP (2004) Landscape regularity and random walks for the job-shop scheduling problem. Evol Comput Combin Opt, 21–30

    Google Scholar 

  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. 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. 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–103

    Google Scholar 

  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–623

    Google Scholar 

  49. Watson JP, Beck JC, Howe AE, Whitley LD (2003) Problem difficulty for tabu search in job-shop scheduling. Art Int 143(2):189–217

    Article  MathSciNet  MATH  Google Scholar 

  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–245

    Google Scholar 

  51. Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Operat Res Soc 41(11):1069–1072

    Article  Google Scholar 

  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–2636

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  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–310

    Article  MathSciNet  MATH  Google Scholar 

  55. Cheng R (1997) A study on genetic algorithms-based optimal scheduling techniques. PhD thesis. Tokyo Institute of Technology

    Google Scholar 

  56. Park BJ, Choi HR, Kim HS (2003) A hybrid genetic algorithm for the job shop scheduling problems. Comput Ind Eng 45:597–613

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mechanical Science and Engineering, HUST, State Key Laboratory of Digital Manufacturing and Equipment Technology, Wuhan, Hubei, China

    Xinyu Li

  2. School of Mechanical Science and Engineering, HUST, State Key Laboratory of Digital Manufacturing and Equipment Technology, Wuhan, Hubei, China

    Liang Gao

Authors
  1. Xinyu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liang Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xinyu Li .

Rights and permissions

Reprints and permissions

Copyright information

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

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Li, X., Gao, L. (2020). A Hybrid Algorithm for Job Shop Scheduling Problem. In: Effective Methods for Integrated Process Planning and Scheduling. Engineering Applications of Computational Methods, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55305-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-55305-3_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-55303-9

  • Online ISBN: 978-3-662-55305-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation