IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v35y2024i6d10.1007_s10845-023-02161-w.html
   My bibliography  Save this article

Smart scheduling of dynamic job shop based on discrete event simulation and deep reinforcement learning

Author

Listed:
  • Ziqing Wang

    (Chongqing University)

  • Wenzhu Liao

    (Chongqing University)

Abstract

In the era of Industry 4.0, production scheduling as a critical part of manufacturing system should be smarter. Smart scheduling agent is required to be real-time autonomous and possess the ability to face unforeseen and disruptive events. However, traditional methods lack adaptability and intelligence. Hence, this paper is devoted to proposing a smart approach based on proximal policy optimization (PPO) to solve dynamic job shop scheduling problem with random job arrivals. The PPO scheduling agent is trained based on an integration framework of discrete event simulation and deep reinforcement learning. Copies of trained agent can be linked with each machine for distributed control. Meanwhile, state features, actions and rewards are designed for scheduling at each decision point. Reward scaling are applied to improve the convergence performance. The numerical experiments are conducted on cases with different production configurations. The results show that PPO method can realize on-line decision making and provide better solution than dispatch rules and heuristics. It can achieve a balance between time and quality. Moreover, the trained model could also maintain certain performance even in untrained scenarios.

Suggested Citation

  • Ziqing Wang & Wenzhu Liao, 2024. "Smart scheduling of dynamic job shop based on discrete event simulation and deep reinforcement learning," Journal of Intelligent Manufacturing, Springer, vol. 35(6), pages 2593-2610, August.
  • Handle: RePEc:spr:joinma:v:35:y:2024:i:6:d:10.1007_s10845-023-02161-w
    DOI: 10.1007/s10845-023-02161-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-023-02161-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10845-023-02161-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joinma:v:35:y:2024:i:6:d:10.1007_s10845-023-02161-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.