Abstract
Dispatching rules are extensively addressed in the dynamic job shop scheduling literature and are commonly adopted in many industrial practices. The manual design of dispatching rules is a tedious process that requires a great deal of time and experience. Due to the growth in computational power, the design process is automated using various machine learning and optimization techniques to evolve superior dispatching rules compared to human-made ones. Genetic Programming (GP) is one of the most promising approaches in the field of automated design of scheduling rules, especially under dynamic conditions. Considering a large set of terminals that reflects various job and machine attributes helps GP to obtain efficient rules, but in return extends the search space. Also, the impact of terminals can vary greatly among various scenarios, objective functions, and evolutionary stages. Therefore, an efficient feature selection mechanism can support the GP searching ability by eliminating irrelevant terminals and facilitating the process of high-quality rule search by focusing more on the promising regions in the search space. In this paper, we propose a new representation for the GP individuals that reflects the importance of each terminal in this rule. Also, an adaptive feature selection mechanism is developed that uses the information gained from the previous evolutionary step in restricting the search space at the current generation. Experimental results show that the proposed approaches assist the GP to obtain compact rules in a shorter computational time without sacrificing the performance compared with the standard GP algorithm and another representation from the literature.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ouelhadj, D., Petrovic, S.: A survey of dynamic scheduling in manufacturing systems. J. Sched. 12, 417–431 (2009). https://doi.org/10.1007/s10951-008-0090-8
Branke, J., Nguyen, S., Pickardt, C.W., Zhang, M.: Automated design of production scheduling heuristics: a review. IEEE Trans. Evol. Comput. 20, 110–124 (2016). https://doi.org/10.1109/TEVC.2015.2429314
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
Shady, S., Kaihara, T., Fujii, N., Kokuryo, D.: A hyper-heuristic framework using GP for dynamic job shop scheduling problem. In: Proceedings of the 64th Annual Conference of the Institute of Systems, Control and Information Engineers (ISCIE), pp. 248–252 (2020)
Nie, L., Gao, L., Li, P., Zhang, L.: Application of gene expression programming on dynamic job shop scheduling problem. In: Proceedings of the 2011 15th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2011, pp. 291–295 (2011). https://doi.org/10.1109/CSCWD.2011.5960088
Nguyen, S., Mei, Y., Xue, B., Zhang, M.: A hybrid genetic programming algorithm for automated design of dispatching rules. Evol. Comput. 27, 467–596 (2018). https://doi.org/10.1162/evco_a_00230
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, 339–353 (2017). https://doi.org/10.1109/tetci.2017.2743758
Zhang, F., Mei, Y., Zhang, M.: A two-stage genetic programming hyper-heuristic approach with feature selection for dynamic flexible job shop scheduling. In: Proceedings of the 2019 Genetic and Evolutionary Computation Conference, pp. 347–355. Association for Computing Machinery, USA (2019). https://doi.org/10.1145/3321707.3321790
Hunt, R., Richard, J., Zhang, M.: Evolving dispatching rules with greater understandability for dynamic job shop scheduling. School of Engineering and Computer Science, Victoria University of Wellington, 2016 (2016)
Shady, S., Kaihara, T., Fujii, N., Kokuryo, D.: Automatic design of dispatching rules with genetic programming for dynamic job shop scheduling. In: Lalic, B., Majstorovic, V., Marjanovic, U., von Cieminski, G., Romero, D. (eds.) APMS 2020. IAICT, vol. 591, pp. 399–407. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-57993-7_45
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 IFIP International Federation for Information Processing
About this paper
Cite this paper
Shady, S., Kaihara, T., Fujii, N., Kokuryo, D. (2021). A New Representation and Adaptive Feature Selection for Evolving Compact Dispatching Rules for Dynamic Job Shop Scheduling with Genetic Programming. In: Dolgui, A., Bernard, A., Lemoine, D., von Cieminski, G., Romero, D. (eds) Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems. APMS 2021. IFIP Advances in Information and Communication Technology, vol 632. Springer, Cham. https://doi.org/10.1007/978-3-030-85906-0_70
Download citation
DOI: https://doi.org/10.1007/978-3-030-85906-0_70
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85905-3
Online ISBN: 978-3-030-85906-0
eBook Packages: Computer ScienceComputer Science (R0)