Abstract
Job shop scheduling (JSS) is a hard problem with most of the research focused on scenarios with the assumption that the shop parameters such as processing times, due dates are constant. But in the real world uncertainty in such parameters is a major issue. In this work, we investigate a genetic programming based hyper-heuristic approach to evolving dispatching rules suitable for dynamic job shop scheduling under uncertainty. We consider uncertainty in processing times and consider multiple job types pertaining to different levels of uncertainty. In particular, we propose an approach to use exponential moving average of the deviations of the processing times in the dispatching rules. We test the performance of the proposed approach under different uncertain scenarios. Our results show that the proposed method performs significantly better for a wide range of uncertain scenarios.
Keywords
- Processing Time
- Genetic Programming
- Problem Instance
- Reactive Schedule
- Permutation Flow Shop Schedule Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Balasubramanian, J., Grossmann, I.: Approximation to multistage stochastic optimization in multiperiod batch plant scheduling under demand uncertainty. Industrial & engineering chemistry research 43(14), 3695–3713 (2004)
Bhat, U.N.: An introduction to queueing theory: modeling and analysis in applications. Birkhäuser (2015)
Branke, J., Hildebrandt, T., Scholz-Reiter, B.: Hyper-heuristic evolution of dispatching rules: A comparison of rule representations. Evolutionary computation 23(2), 249–277 (2015)
Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Qu, R.: Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society 64(12), 1695–1724 (2013)
Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.R.: Exploring hyper-heuristic methodologies with genetic programming. In: Computational intelligence, pp. 177–201. Springer (2009)
Calleja, G., Pastor, R.: A dispatching algorithm for flexible job-shop scheduling with transfer batches: an industrial application. Production Planning & Control 25(2), 93–109 (2014)
Davenport, A.J., Beck, J.C.: A survey of techniques for scheduling with uncertainty. Unpublished manuscript. Available from http://tidel.mie.utoronto.ca/publications.php (2000)
Fortemps, P.: Jobshop scheduling with imprecise durations: a fuzzy approach. IEEE Transactions on Fuzzy Systems 5(4), 557–569 (1997)
Gao, K.Z., Suganthan, P.N., Tasgetiren, M.F., Pan, Q.K., Sun, Q.Q.: Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion. Computers & Industrial Engineering 90, 107–117 (2015)
Hildebrandt, T.: Jasima – an efficient java simulator for manufacturing and logistics. http://code.google.com/p/jasima (2012)
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. ACM (2010)
Ho, N.B., Tay, J.C.: Evolving dispatching rules for solving the flexible job-shop problem. In: 2005 IEEE Congress on Evolutionary Computation. vol. 3, pp. 2848–2855. IEEE (2005)
Huercio, A., Espuna, A., Puigjaner, L.: Incorporating on-line scheduling strategies in integrated batch production control. Computers & chemical engineering 19, 609–614 (1995)
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. ACM (2014)
Jakobović, D., Jelenković, L., Budin, L.: Genetic programming heuristics for multiple machine scheduling. In: Genetic Programming, pp. 321–330. Springer (2007)
Janak, S.L., Floudas, C.A., Kallrath, J., Vormbrock, N.: Production scheduling of a large-scale industrial batch plant. ii. reactive scheduling. Industrial & engineering chemistry research 45(25), 8253–8269 (2006)
Kanakamedala, K.B., Reklaitis, G.V., Venkatasubramanian, V.: Reactive schedule modification in multipurpose batch chemical plants. Industrial & engineering chemistry research 33(1), 77–90 (1994)
Kouvelis, P., Yu, G.: Robust discrete optimization and its applications, vol. 14. Springer Science & Business Media (2013)
Lawrence, S.R., Sewell, E.C.: Heuristic, optimal, static, and dynamic schedules when processing times are uncertain. Journal of Operations Management 15(1), 71–82 (1997)
Li, Z., Ierapetritou, M.: Process scheduling under uncertainty: Review and challenges. Computers & Chemical Engineering 32(4), 715–727 (2008)
Liu, K.C.: Dispatching rules for stochastic finite capacity scheduling. Computers & industrial engineering 35(1), 113–116 (1998)
Luke, S.: Essentials of metaheuristics. Lulu Com (2013)
Matsuura, H., Tsubone, H., Kanezashi, M.: Sequencing, dispatching and switching in a dynamic manufacturing environment. The International Journal of Production Research 31(7), 1671–1688 (1993)
Nguyen, S.: Automatic design of dispatching rules for job shop scheduling with genetic programming (2013)
Penz, B., Rapine, C., Trystram, D.: Sensitivity analysis of scheduling algorithms. European Journal of Operational Research 134(3), 606–615 (2001)
Pinedo, M.: Stochastic batch scheduling and the “smallest variance first” rule. Probability in the Engineering and Informational Sciences 21(04), 579–595 (2007)
Pinedo, M., Weiss, G.: The largest variance first policy in some stochastic scheduling problems. Operations Research 35(6), 884–891 (1987)
Rai, S., Duke, C.B., Lowe, V., Quan-Trotter, C., Scheermesser, T.: Ldp lean document production-or-enhanced productivity improvements for the printing industry. Interfaces 39(1), 69–90 (2009)
Rodrigues, M., Gimeno, L., Passos, C., Campos, M.: Reactive scheduling approach for multipurpose chemical batch plants. Computers & chemical engineering 20, S1215–S1220 (1996)
Salvendy, G.: Handbook of industrial engineering: technology and operations management. John Wiley & Sons (2001)
Vazquez-Rodriguez, J.A., Ochoa, G.: On the automatic discovery of variants of the neh procedure for flow shop scheduling using genetic programming. Journal of the Operational Research Society 62(2), 381–396 (2011)
Vepsalainen, A.P., Morton, T.E.: Priority rules for job shops with weighted tardiness costs. Management science 33(8), 1035–1047 (1987)
Van den Akker, M., Hoogeveen, H.: Minimizing the number of late jobs in a stochastic setting using a chance constraint. Journal of Scheduling 11(1), 59–69 (2008)
Yin, W.J., Liu, M., Wu, C.: Learning single-machine scheduling heuristics subject to machine breakdowns with genetic programming. In: Evolutionary Computation, 2003. CEC’03. The 2003 Congress on. vol. 2, pp. 1050–1055. IEEE (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Karunakaran, D., Mei, Y., Chen, G., Zhang, M. (2017). Dynamic Job Shop Scheduling Under Uncertainty Using Genetic Programming. In: Leu, G., Singh, H., Elsayed, S. (eds) Intelligent and Evolutionary Systems. Proceedings in Adaptation, Learning and Optimization, vol 8. Springer, Cham. https://doi.org/10.1007/978-3-319-49049-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-49049-6_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49048-9
Online ISBN: 978-3-319-49049-6
eBook Packages: EngineeringEngineering (R0)