Skip to main content
SpringerLink
Log in

Simplifying Dispatching Rules in Genetic Programming for Dynamic Job Shop Scheduling

  • Conference paper
  • First Online:
Evolutionary Computation in Combinatorial Optimization (EvoCOP 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13222))

Abstract

Evolving dispatching rules through Genetic Programming (GP) has been shown to be successful for solving Dynamic Job Shop Scheduling (DJSS). However, the GP-evolved rules are often very large and complex, and are hard to interpret. Simplification is a promising technique that can reduce the size of GP individuals without sacrificing effectiveness. However, GP with simplification has not been studied in the context of evolving DJSS rules. This paper proposes a new GP with simplification for DJSS, and analyses its performance in evolving both effective and simple/small rules. In addition to adopting the generic algebraic simplification operators, we also developed new problem-specific numerical and behavioural simplification operators for DJSS. The results show that the proposed approach can obtain better and simpler rules than the baseline GP and existing GP algorithms with simplification. Further analysis verified the effectiveness of the newly developed numerical and simplification operators.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bader-El-Den, M., Poli, R., Fatima, S.: Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework. Memetic Comput. 1(3), 205–219 (2009)

    Article  Google Scholar 

  2. 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 

  3. Blazewicz, J., Dror, M., Weglarz, J.: Mathematical programming formulations for machine scheduling: a survey. Eur. J. Oper. Res. 51(3), 283–300 (1991)

    Article  Google Scholar 

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

    Article  Google Scholar 

  5. Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discret. Appl. Math. 49(1–3), 107–127 (1994)

    Article  MathSciNet  Google Scholar 

  6. Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.R.: Exploring hyper-heuristic methodologies with genetic programming. In: Mumford, C.L., Jain, L.C. (eds.) Computational Intelligence, pp. 177–201. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01799-5_6

    Chapter  Google Scholar 

  7. Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 449–468. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-1665-5_15

    Chapter  Google Scholar 

  8. Burke, E.K., Hyde, M., Kendall, G., Woodward, J.: A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics. IEEE Trans. Evol. Comput. 14(6), 942–958 (2010)

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. Dominic, P.D., Kaliyamoorthy, S., Kumar, M.S.: Efficient dispatching rules for dynamic job shop scheduling. Int. J. Adv. Manuf. Technol. 24(1), 70–75 (2004)

    Google Scholar 

  11. Gao, D., Wang, G.G., Pedrycz, W.: Solving fuzzy job-shop scheduling problem using de algorithm improved by a selection mechanism. IEEE Trans. Fuzzy Syst. 28(12), 3265–3275 (2020)

    Article  Google Scholar 

  12. Garza-Santisteban, F., et al.: A simulated annealing hyper-heuristic for job shop scheduling problems. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 57–64. IEEE (2019)

    Google Scholar 

  13. Gonçalves, J.F., de Magalhães Mendes, J.J., Resende, M.G.: A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. 167(1), 77–95 (2005)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  15. Javed, N., Gobet, F.: On-the-fly simplification of genetic programming models. In: Proceedings of the 36th Annual ACM Symposium on Applied Computing, pp. 464–471. Association for Computing Machinery, New York, March 2021

    Google Scholar 

  16. Jayamohan, M., Rajendran, C.: Development and analysis of cost-based dispatching rules for job shop scheduling. Eur. J. Oper. Res. 157(2), 307–321 (2004)

    Article  Google Scholar 

  17. Kaban, A., Othman, Z., Rohmah, D.: Comparison of dispatching rules in job-shop scheduling problem using simulation: a case study. Int. J. Simul. Model. 11(3), 129–140 (2012)

    Article  Google Scholar 

  18. Kinzett, D., Johnston, M., Zhang, M.: Numerical simplification for bloat control and analysis of building blocks in genetic programming. Evol. Intel. 2(4), 151 (2009)

    Article  Google Scholar 

  19. Kolonko, M.: Some new results on simulated annealing applied to the job shop scheduling problem. Eur. J. Oper. Res. 113(1), 123–136 (1999)

    Article  Google Scholar 

  20. Liu, Y., Mei, Y., Zhang, M., Zhang, Z.: Automated heuristic design using genetic programming hyper-heuristic for uncertain capacitated arc routing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 290–297 (2017)

    Google Scholar 

  21. 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 

  22. 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 

  23. Miller, H.E., Pierskalla, W.P., Rath, G.J.: Nurse scheduling using mathematical programming. Oper. Res. 24(5), 857–870 (1976)

    Article  Google Scholar 

  24. Mokotoff, E., Chrétienne, P.: A cutting plane algorithm for the unrelated parallel machine scheduling problem. Eur. J. Oper. Res. 141(3), 515–525 (2002)

    Article  MathSciNet  Google Scholar 

  25. 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). https://doi.org/10.1007/s40747-017-0036-x

    Article  Google Scholar 

  26. Panda, S., Mei, Y.: Genetic programming with algebraic simplification for dynamic job shop scheduling. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 1848–1855. IEEE (2021)

    Google Scholar 

  27. Park, J., Mei, Y., Nguyen, S., Chen, G., Zhang, M.: Evolutionary multitask optimisation for dynamic job shop scheduling using niched genetic programming. In: Mitrovic, T., Xue, B., Li, X. (eds.) AI 2018. LNCS (LNAI), vol. 11320, pp. 739–751. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-03991-2_66

    Chapter  Google Scholar 

  28. Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35(10), 3202–3212 (2008)

    Article  Google Scholar 

  29. Rajendran, C., Holthaus, O.: A comparative study of dispatching rules in dynamic flowshops and jobshops. Eur. J. Oper. Res. 116(1), 156–170 (1999)

    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. Tan, B., Ma, H., Mei, Y., Zhang, M.: A cooperative coevolution genetic programming hyper-heuristic approach for on-line resource allocation in container-based clouds. IEEE Trans. Cloud Comput. (2020)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  33. Vepsalainen, A.P., Morton, T.E.: Priority rules for job shops with weighted tardiness costs. Manag. Sci. 33(8), 1035–1047 (1987)

    Article  Google Scholar 

  34. Wang, H., Jiang, Z., Wang, Y., Zhang, H., Wang, Y.: A two-stage optimization method for energy-saving flexible job-shop scheduling based on energy dynamic characterization. J. Clean. Prod. 188, 575–588 (2018)

    Article  Google Scholar 

  35. Wong, P., Zhang, M.: Algebraic simplification of GP programs during evolution. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 927–934 (2006)

    Google Scholar 

  36. Wong, P., Zhang, M.: Effects of program simplification on simple building blocks in genetic programming. In: 2007 IEEE Congress on Evolutionary Computation, pp. 1570–1577. IEEE (2007)

    Google Scholar 

  37. Zhang, F., Mei, Y., Nguyen, S., Tan, K.C., Zhang, M.: Multitask genetic programming based generative hyper-heuristics: a case study in dynamic scheduling. IEEE Trans. Cybern. (2021)

    Google Scholar 

  38. Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Collaborative multifidelity-based surrogate models for genetic programming in dynamic flexible job shop scheduling. IEEE Trans. Cybern. (2021)

    Google Scholar 

  39. Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Evolving scheduling heuristics via genetic programming with feature selection in dynamic flexible job shop scheduling. IEEE Trans. Cybern. 51(4), 1797–1811 (2021)

    Article  Google Scholar 

  40. Zhang, F., Mei, Y., Nguyen, S., Zhang, M., Tan, K.C.: Surrogate-assisted evolutionary multitasking genetic programming for dynamic flexible job shop scheduling. IEEE Trans. Evol. Comput. 25(4), 651–665 (2020)

    Article  Google Scholar 

  41. Zhang, M., Wong, P.: Explicitly simplifying evolved genetic programs during evolution. Int. J. Comput. Intell. Appl. 7(02), 201–232 (2008)

    Article  Google Scholar 

  42. Zhang, M., Wong, P.: Genetic programming for medical classification: a program simplification approach. Genet. Program Evolvable Mach. 9(3), 229–255 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Victoria University of Wellington, PO Box 600, Kelburn, New Zealand

    Sai Panda, Yi Mei & Mengjie Zhang

Authors
  1. Sai Panda
    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. Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile

    Leslie Pérez Cáceres

  2. Université du Littoral Côte d’Opale, Calais, France

    Sébastien Verel

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Panda, S., Mei, Y., Zhang, M. (2022). Simplifying Dispatching Rules in Genetic Programming for Dynamic Job Shop Scheduling. In: Pérez Cáceres, L., Verel, S. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2022. Lecture Notes in Computer Science, vol 13222. Springer, Cham. https://doi.org/10.1007/978-3-031-04148-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-04148-8_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-04147-1

  • Online ISBN: 978-3-031-04148-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation