skip to main content
10.1145/3423390.3426725acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicacsConference Proceedingsconference-collections
research-article

AI-Based Discrete-Event Simulations for Manufacturing Schedule Optimization

Published:25 November 2020Publication History

ABSTRACT

Optimization of manufacturing schedules is of great theoretical and practical significance, especially when high-tech products are produced in large manufacturing networks with global supply chains. In this paper, a novel approach is described how discrete-event simulations shall be enhanced by Artificial Intelligence (AI) to optimize manufacturing schedules for complex job shop manufacturing networks in the high-tech energy industry.

This work attempts to close the gap between the growing expectations on AI-based discrete-event simulations for manufacturing schedule optimization on the one hand and the current limitations of data quality and Information Technology (IT) capabilities in existing Enterprise Resource Planning (ERP) systems on the other hand. In order to deliver the expected benefits, business targets of schedule optimization need to be understood, the solution approach has to be defined and verified in a complex manufacturing environment. Performance and reliability of the implemented solution are validated with two real data sets derived from ongoing business planning activities.

An actor-critic architecture is proposed which uses a multi-stage schedule compression algorithm for modifying the start dates of production orders according to defined business targets and a genetic algorithm which selects production orders for automated make or buy decisions. The first research result is the provision of a manufacturing schedule for 375 product types, more than 180 manufacturing resources, 367 process variants (routings), and a total of 1.293 production orders at about 80% average capacity utilization of bottleneck machinery in a 12 months planning horizon, which is optimized according to lead times of customer products. The second research result is the generation of a manufacturing schedule for 3.657 production orders in a 24 months planning horizon, where the optimal outsourcing portion is calculated according to defined extensions of standard lead times within the same supply and manufacturing network.

References

  1. Stricker, N./ Kuhnle, A./ Sturm, R./ Friess, S., Reinforcement learning for adaptive order dispatching in the semiconductor industry, CIRP Annals -- Manufacturing Technology 67, 2018, 511--514.Google ScholarGoogle ScholarCross RefCross Ref
  2. Sotskov, Y./ Egorova, Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective, in: Werner, F./ Burtseva, L./ Sotskov, Y., Algorithms for Scheduling Problems, MDPI, 2018, 21--40.Google ScholarGoogle Scholar
  3. Vakhania, N., Scheduling a Single Machine with Primary and Secondary Objectives, in: Werner, F./ Burtseva, L./Sotskov, Y., Algorithms for Scheduling Problems, MDPI, 2018, 41--56.Google ScholarGoogle Scholar
  4. Fuchigami, H. Y./ Sarker, R./ Rangel, S., Near-Optimal Heuristics for Just-In-Time Jobs Maximization in Flow Shop Scheduling, in: Werner, F./ Burtseva, L./ Sotskov, Y., Algorithms for Scheduling Problems, MDPI, 2018, 57--73.Google ScholarGoogle Scholar
  5. Drugan, M. M., Reinforcement learning versus evolutionary computation: A survey on hybrid algorithms, Swarm and Evolutionary Computation 44, 2019, 228--246.Google ScholarGoogle ScholarCross RefCross Ref
  6. Rooyani, D./ Defersha, F. M., An Efficient Two-Stage Genetic Algorithm for Flexible Job-Shop Scheduling, Science Direct, IFAC PapersOnLine 52-13, 2019, 25192524.Google ScholarGoogle Scholar
  7. Waschnek, B./ Reichstaller, A./ Belzner, L./ Altenmüller, T./ Bauernhansl, T./ Knapp, A./ Kyek, A., Optimization of global production scheduling with deep reinforcement learning. In 51st CIRP Conference on Manufacturing Systems, Science Direct, Procedia CIRP 72 (2018), 1264--1269.Google ScholarGoogle ScholarCross RefCross Ref
  8. Ghavamzadeh, M./ Mannor, S./ Pineau, J./ Tamar, A., Bayesian Reinforcement Learning: A Survey, now Publishers, 2015, 359--483. http://dx.doi.org/10.1561/2200000049Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Ghavamzadeh, M./ Engel, Y./ Valko, M., Bayesian policy gradient and actor-critic algorithms, Journal of Machine Learning Research 17, 2016, ResearchGate, 1--53.Google ScholarGoogle Scholar
  10. Kasie, F. M./ Bright, G./ Walker, A., Decision support systems in manufacturing: a survey and future trends. Journal of Modelling in Management, Vol. 12 No. 3, 2017, 432--454. https://doi.org/10.1108/JM2-02-2016-0015.Google ScholarGoogle ScholarCross RefCross Ref
  11. Lassig, L. Mazzer, F. Nicolich. Poloni, C., Hybrid flow shop management: multi objective optimization, ScienceDirect, Procedia CIRP 62, 2017, 147--152.Google ScholarGoogle ScholarCross RefCross Ref
  12. Such, F. P./ Madhavan, V./ Conti, E./ Lehman, J./ Stanley, K. O./ Clune, J, Deep Neurorevolution: Genetic Algorithms are a Competitive Alternative for Training Deep Neural Networks for Reinforcement Learning, Uber AI Labs, 2018, arXiv:1712.06567v3.Google ScholarGoogle Scholar
  13. Palombarini, J. A./ Martinez, E. C., Closed-Loop Rescheduling using Deep Reinforcement Learning, ScienceDirect, IFAC PapersOnline 52-1, 2019, 231--236.Google ScholarGoogle ScholarCross RefCross Ref
  14. Sheikh, H. U./ Bölöni, L., Multi-Agent Reinforcement Learning for Problems with Combined Individual and Team Reward, Cornell University, 2020, arXiv:2003.10598v1.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. AI-Based Discrete-Event Simulations for Manufacturing Schedule Optimization

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ICACS '20: Proceedings of the 4th International Conference on Algorithms, Computing and Systems
      January 2020
      109 pages
      ISBN:9781450377324
      DOI:10.1145/3423390

      Copyright © 2020 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 25 November 2020

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader