Abstract
Dynamic job shop scheduling (DJSS) problems are combinatorial optimisation problems that have been extensively studied in the literature due to their difficulty and their applicability to real-world manufacturing systems, e.g., car manufacturing systems. In a DJSS problem instance, jobs arrive on the shop floor to be processed on specific sequences of machines on the shop floor and unforeseen events such as dynamic job arrivals and machine breakdown occur that affect the properties of the shop floor. Many researchers have proposed genetic programming based hyper-heuristic (GP-HH) approaches to evolve high quality dispatching rules for DJSS problems with dynamic job arrivals, outperforming good man-made rules for the problems. However, no GP-HH approaches have been proposed for DJSS problems with dynamic job arrivals and machine breakdowns, and it is not known how well GP generalises over both DJSS problem instances with no machine breakdown to problem instances with machine breakdown. Therefore, this paper investigates the generality of GP for DJSS problem with dynamic job arrivals and machine breakdowns. To do this, a machine breakdown specific DJSS dataset is proposed, and an analysis procedure is used to observe the differences in the structures of the GP rules when evolved under different machine breakdown scenarios. The results show that performance and the distributions of the terminals for the evolved rules is sensitive to the frequency of machine breakdowns in the training instances used to evolve the rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 4th edn. Springer, Heidelberg (2012)
Ouelhadj, D., Petrovic, S.: A survey of dynamic scheduling in manufacturing systems. J. Sched. 12(4), 417–431 (2009)
Hildebrandt, T., Branke, J.: On using surrogates with genetic programming. Evol. Comput. J. (ECJ) 23(3), 1–25 (2015)
Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem. IEEE Trans. Evol. Comput. 17(5), 621–639 (2013)
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, pp. 257–264 (2010)
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)
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 (2016)
Hunt, R., Johnston, M., Zhang, M.: Evolving “less-myopic” scheduling rules for dynamic job shop scheduling with genetic programming. In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation, pp. 927–934 (2014)
Holthaus, O.: Scheduling in job shops with machine breakdowns: an experimental study. Comput. Ind. Eng. 36(1), 137–162 (1999)
Vepsalainen, A.P.J., Morton, T.E.: Priority rules for job shops with weighted tardiness costs. Manag. Sci. 33(8), 1035–1047 (1987)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Park, J., Mei, Y., Nguyen, S., Chen, G., Zhang, M. (2017). Investigating the Generality of Genetic Programming Based Hyper-heuristic Approach to Dynamic Job Shop Scheduling with Machine Breakdown. In: Wagner, M., Li, X., Hendtlass, T. (eds) Artificial Life and Computational Intelligence. ACALCI 2017. Lecture Notes in Computer Science(), vol 10142. Springer, Cham. https://doi.org/10.1007/978-3-319-51691-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-51691-2_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-51690-5
Online ISBN: 978-3-319-51691-2
eBook Packages: Computer ScienceComputer Science (R0)