Skip to main content
SpringerLink
Log in

Genetic Programming Hyper-Heuristic with Cooperative Coevolution for Dynamic Flexible Job Shop Scheduling

  • Conference paper
  • First Online:
Genetic Programming (EuroGP 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10781))

Included in the following conference series:

Abstract

Flexible Job Shop Scheduling (FJSS) problem has many real-world applications such as manufacturing and cloud computing, and thus is an important area of study. In real world, the environment is often dynamic, and unpredicted job orders can arrive in real time. Dynamic FJSS consists of challenges of both dynamic optimisation and the FJSS problem. In Dynamic FJSS, two kinds of decisions (so-called routing and sequencing decisions) are to be made in real time. Dispatching rules have been demonstrated to be effective for dynamic scheduling due to their low computational complexity and ability to make real-time decisions. However, it is time consuming and strenuous to design effective dispatching rules manually due to the complex interactions between job shop attributes. Genetic Programming Hyper-heuristic (GPHH) has shown success in automatically designing dispatching rules which are much better than the manually designed ones. Previous works only focused on standard job shop scheduling with only the sequencing decisions. For FJSS, the routing rule is set arbitrarily by intuition. In this paper, we explore the possibility of evolving both routing and sequencing rules together and propose a new GPHH algorithm with Cooperative Co-evolution. Our results show that co-evolving the two rules together can lead to much more promising results than evolving the sequencing rule only.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

References

  1. Barnes, J.W., Chambers, J.B.: Solving the job shop scheduling problem with tabu search. IIE Trans. 27(2), 257–263 (1995)

    Article  Google Scholar 

  2. Behnke, D., Geiger, M.J.: Test instances for the flexible job shop scheduling problem with work centers. Technical report, Helmut Schmidt Universitat, January 2012

    Google Scholar 

  3. Blackstone, J.H., Phillips, D.T., Hogg, G.L.: A state-of-the-art survey of dispatching rules for manufacturing job shop operations. Int. J. Prod. Res. 20(1), 27–45 (1982)

    Article  Google Scholar 

  4. Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41, 157–183 (1993)

    Article  MATH  Google Scholar 

  5. Branke, J., Nguyen, S., Pickardt, C., Zhang, M.: Automated design of production scheduling heuristics: a review. IEEE Trans. Evol. Comput. 20(1), 110–124 (2016)

    Article  Google Scholar 

  6. Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369–375 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  7. Burke, E., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695–1724 (2013)

    Article  Google Scholar 

  8. Dauzere-Peres, S., Paulli, J.: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann. Oper. Res. 70, 281–306 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Dimopoulos, C., Zalzala, A.: Invesigating the use of genetic programming for a classic one-machine scheduling problem. Adv. Eng. Softw. 32, 489–498 (2001)

    Article  MATH  Google Scholar 

  10. Geiger, C.D., Uzsoy, R., Aytug, H.: Rapid modeling and discovery of priority dispatching rules: an autonomous learning approach. J. Sched. 9, 7–34 (2006)

    Article  MATH  Google Scholar 

  11. Hildebrandt, T., Branke, J.: On using surrogates with genetic programming. Evol. Comput. 23(3), 343–367 (2015)

    Article  Google Scholar 

  12. Hildebrandt, T., Heger, J., Scholz-Reiter, B.: Towards improved dispatching rules for complex shop floor scenarios–a genetic programming approach. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation Conference (2010)

    Google Scholar 

  13. Ho, N.B., Tay, J.C.: Genace: an efficient cultural algorithm for solving the flexible job-shop problem. In: IEEE Congress on Evolutionary Computation, vol. 2, pp. 1759–1766. IEEE (2004)

    Google Scholar 

  14. Hurink, J., Jurisch, B., Thole, M.: Tabu search for the job-shop scheduling problem with multi-purpose machines. Oper. Res. Spektrum 15(4), 205–215 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  15. Jones, A., Rabelo, L.C., Sharawi, A.T.: Survey of job shop scheduling techniques. In: Wiley Encyclopedia of Electrical and Electronics Engineering. John Wiley & Sons, New York (1999)

    Google Scholar 

  16. Kacem, I., Hammadi, S., Borne, P.: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Syst. Man Cybern. 32(1), 1–13 (2002)

    Article  MATH  Google Scholar 

  17. Kiran, A.S.: Simulation studies in job shop scheduling - I a survey. Comput. Ind. Eng. 8(2), 87–93 (1984)

    Article  Google Scholar 

  18. Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497–520 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  19. Mei, Y., Nguyen, S., Xue, B., Zhang, M.: An efficient feature selection algorithm for evolving job shop scheduling rules with genetic programming. IEEE Trans. Emerg. Top. Comput. Intell. 1(5), 339–353 (2017)

    Article  Google Scholar 

  20. Mei, Y., Nguyen, S., Zhang, M.: Evolving time-invariant dispatching rules in job shop scheduling with genetic programming. In: McDermott, J., Castelli, M., Sekanina, L., Haasdijk, E., García-Sánchez, P. (eds.) EuroGP 2017. LNCS, vol. 10196, pp. 147–163. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-55696-3_10

    Chapter  Google Scholar 

  21. Mei, Y., Zhang, M., Nyugen, S.: Feature selection in evolving job shop dispatching rules with genetic programming. In: GECCO (2016)

    Google Scholar 

  22. Miyashita, K.: Job-shop scheduling with GP. In: Genetic and Evolutionary Computation Conference (2000)

    Google Scholar 

  23. Nguyen, S., Mei, Y., Zhang, M.: Genetic programming for production scheduling: a survey with a unified framework. Complex Intell. Syst. 3(1), 41–66 (2017)

    Article  Google Scholar 

  24. Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: Automatic design of scheduling policies for dynamic multi-objective job shop scheduling via cooperative coevolution genetic programming. IEEE Trans. Evol. Comput. 18(2), 193–208 (2014)

    Article  Google Scholar 

  25. Norman, B.A., Bean, J.C.: A genetic algorithm methodology for complex scheduling problems. Nav. Res. Logist. 46(2), 199–211 (1999)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  27. Pinedo, M.L.: Scheduling: Theory, Algorithms and Systems. Springer, New York (2012)

    Book  MATH  Google Scholar 

  28. Potter, M.A., Jong, K.A.D.: Cooperative coevolution: an architecture for evolving coadapted subcomponents. Evol. Compt. 8, 1–29 (2000)

    Article  Google Scholar 

  29. Ramasesh, R.: Dynamic job shop scheduling: a survey of simulation research. Omega 18(1), 43–57 (1990)

    Article  Google Scholar 

  30. Sels, V., Gheysen, N., Vanhoucke, M.: A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions. Int. J. Prod. Res. 50(15), 4255–4270 (2012)

    Article  Google Scholar 

  31. Subramaniam, V., Ramesh, T., Lee, G.K., Wong, Y.S., Hong, G.S.: Job shop scheduling with dynamic fuzzy selection of dispatching rules. Int. J. Adv. Manuf. Technol. 16, 759–764 (2000)

    Article  Google Scholar 

  32. Tay, J., Ho, N.: Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput. Ind. Eng. 54(3), 453–473 (2008)

    Article  Google Scholar 

  33. Tay, J.C., Ho, N.B.: Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Technical report, Evolutionary and Complex Systems Program, School of Computer Engineering, Nanyang Technological University (2007)

    Google Scholar 

  34. van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job shop scheduling by simulated annealing. Oper. Res. 40(1), 113–125 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  35. Zhang, G., Gao, L., Shi, Y.: An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst. Appl. 38(4), 3563–3573 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Victoria University of Wellington, Wellington, New Zealand

    Daniel Yska, Yi Mei & Mengjie Zhang

Authors
  1. Daniel Yska
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi Mei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mengjie Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yi Mei .

Editor information

Editors and Affiliations

  1. Universidade Nova de Lisboa, Lisbon, Portugal

    Mauro Castelli

  2. Brno University of Technology, Brno, Czech Republic

    Lukas Sekanina

  3. Victoria University of Wellington, Wellington, New Zealand

    Mengjie Zhang

  4. University of Parma, Parma, Italy

    Stefano Cagnoni

  5. University of Cádiz, Cádiz, Spain

    Pablo García-Sánchez

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yska, D., Mei, Y., Zhang, M. (2018). Genetic Programming Hyper-Heuristic with Cooperative Coevolution for Dynamic Flexible Job Shop Scheduling. In: Castelli, M., Sekanina, L., Zhang, M., Cagnoni, S., García-Sánchez, P. (eds) Genetic Programming. EuroGP 2018. Lecture Notes in Computer Science(), vol 10781. Springer, Cham. https://doi.org/10.1007/978-3-319-77553-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-77553-1_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-77552-4

  • Online ISBN: 978-3-319-77553-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation