Abstract
Dynamic job shop scheduling is a complex problem in production systems. Automated design of dispatching rules for these systems, particularly using the genetic programming based hyper-heuristics (GPHH) has been a promising approach in recent years. However, GPHH is a computationally intensive and time consuming approach. Parallel evolutionary algorithms are one of the key approaches to tackle this drawback. Furthermore when scheduling is performed under uncertain manufacturing environments while considering multiple conflicting objectives, evolving good rules requires large and diverse training instances. Under limited time and computational budget training on all instances is not possible. Therefore, we need an efficient way to decide which training samples are more suitable for training. We propose a method to sample those problem instances which have the potential to promote the evolution of good rules. In particular, a sampling heuristic which successively rejects clusters of problem instances in favour of those problem instances which show potential in improving the Pareto front for a dynamic multi-objective scheduling problem is developed. We exploit the efficient island model-based approaches to simultaneously consider multiple training instances for GPHH.
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
Bertels, A.R., Tauritz, D.R.: Why asynchronous parallel evolution is the future of hyper-heuristics: A CDCL SAT solver case study. In: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion, pp. 1359–1365. ACM (2016)
Branke, J., Nguyen, S., Pickardt, C., Zhang, M.: Automated design of production scheduling heuristics: a review. IEEE Trans. Evol. Comput. 20, 110–124 (2016)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Hildebrandt, T.: Jasima - an efficient java simulator for manufacturing and logistics. Last Accessed 16 (2012)
Hildebrandt, T., Branke, J.: On using surrogates with genetic programming. Evol. Comput. 23(3), 343–367 (2015)
Karunakaran, D., Chen, G., Zhang, M.: Parallel multi-objective job shop scheduling using genetic programming. In: Ray, T., Sarker, R., Li, X. (eds.) ACALCI 2016. LNCS (LNAI), vol. 9592, pp. 234–245. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-28270-1_20
Karunakaran, D., Mei, Y., Chen, G., Zhang, M.: Toward evolving dispatching rules for dynamic job shop scheduling under uncertainty. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 282–289. ACM (2017)
Kouvelis, P., Yu, G.: Robust Discrete Optimization and its Applications, vol. 14. Springer, Heidelberg (2013). https://doi.org/10.1007/978-1-4757-2620-6
Lawrence, S.R., Sewell, E.C.: Heuristic, optimal, static, and dynamic schedules when processing times are uncertain. J. Oper. Manag. 15(1), 71–82 (1997)
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)
Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: Dynamic multi-objective job shop scheduling: a genetic programming approach. In: Uyar, A., Ozcan, E., Urquhart, N. (eds.) Automated Scheduling and Planning. SCI, vol. 505, pp. 251–282. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39304-4_10
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)
Nowak, K., Izzo, D., Hennes, D.: Injection, saturation and feedback in meta-heuristic interactions. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1167–1174. ACM (2015)
Sudholt, D.: Parallel evolutionary algorithms. In: Kacprzyk, J., Pedrycz, W. (eds.) Springer Handbook of Computational Intelligence, pp. 929–959. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-43505-2_46
Xiao, N., Armstrong, M.P.: A specialized island model and its application in multiobjective optimization. In: Cantú-Paz, E. (ed.) GECCO 2003. LNCS, vol. 2724, pp. 1530–1540. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-45110-2_24
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Karunakaran, D., Mei, Y., Chen, G., Zhang, M. (2018). Sampling Heuristics for Multi-objective Dynamic Job Shop Scheduling Using Island Based Parallel Genetic Programming. In: Auger, A., Fonseca, C., Lourenço, N., Machado, P., Paquete, L., Whitley, D. (eds) Parallel Problem Solving from Nature – PPSN XV. PPSN 2018. Lecture Notes in Computer Science(), vol 11102. Springer, Cham. https://doi.org/10.1007/978-3-319-99259-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-99259-4_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99258-7
Online ISBN: 978-3-319-99259-4
eBook Packages: Computer ScienceComputer Science (R0)