IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i19p5937-5955.html
   My bibliography  Save this article

Multi-resource constrained dynamic workshop scheduling based on proximal policy optimisation

Author

Listed:
  • Peng Cheng Luo
  • Huan Qian Xiong
  • Bo Wen Zhang
  • Jie Yang Peng
  • Zhao Feng Xiong

Abstract

Multi-resource constrained dynamic workshop scheduling is a complex and challenging task in discrete manufacturing. In this paper, to obtain a high-performance scheduling in limited time, this problem is modelled into a Markov decision process, and solved by proximal policy optimisation algorithm, which can learn from the simulated workshop environment directly. A multi-modal hybrid neural network is used in the model to make good use of numerical state features representing workshop environment information and graphical state features representing constraint information during the learning process. Multi-label technique is used in this paper to decouple the output acts of jobs, machines, tools, and workers. Action mask technique coding the constraints is also used to prune invalid exploration. The experimental results show that compared with heuristic rules such as weighted shortest processing time, weighted modified due date, weighted cost over time, apparent tardiness cost and other reinforcement learning methods such as DeepRM and DeepRM2, the performance of the proposed method is at least $ 1.138\% $ 1.138% better in scheduling penalty.

Suggested Citation

  • Peng Cheng Luo & Huan Qian Xiong & Bo Wen Zhang & Jie Yang Peng & Zhao Feng Xiong, 2022. "Multi-resource constrained dynamic workshop scheduling based on proximal policy optimisation," International Journal of Production Research, Taylor & Francis Journals, vol. 60(19), pages 5937-5955, October.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:19:p:5937-5955
    DOI: 10.1080/00207543.2021.1975057
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1975057
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2021.1975057?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:60:y:2022:i:19:p:5937-5955. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.