IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v268y2024ics0925527323003341.html
   My bibliography  Save this article

A deep reinforcement learning based algorithm for a distributed precast concrete production scheduling

Author

Listed:
  • Du, Yu
  • Li, Jun-qing

Abstract

The environmental-friendly production demands higher manufacturing efficiency and lower energy cost; therefore, time-of-use electricity price constraint and distributed production have attracted more attention. For concrete precast architecture construction, the tardiness penalty and warehouse cost cannot be ignored, which should be optimized for lower cost. In this study, the concrete precast process is investigated as the group scheduling of a distributed flexible job shop problem. Each concrete precast is managed in a group, the setup time between different groups is considered. Two objectives, total weighted earliness and tardiness and total time-of-use electricity cost are minimized, simultaneously. To solve the integrated problem, three coordinated double deep Q-networks (DQN) are applied, which are organized as a learn-to-improve reinforcement learning approach. For distributed scheduling problem, operators in a single factory or in multiple factories differs in solution improvement; so selection DQN is designed to decide the type of the operators according to scheduling circumstances. Other two DQNs, i.e., local DQN and global DQN, are to select the optimization operators in one factory or in multiple factories, respectively. Furthermore, two solution refinement strategies are designed to decrease the objectives after reinforcement learning component. Numerical experiment and statistical analysis suggest that the proposed deep reinforcement learning based algorithm has superiority in solving the considered problem.

Suggested Citation

  • Du, Yu & Li, Jun-qing, 2024. "A deep reinforcement learning based algorithm for a distributed precast concrete production scheduling," International Journal of Production Economics, Elsevier, vol. 268(C).
  • Handle: RePEc:eee:proeco:v:268:y:2024:i:c:s0925527323003341
    DOI: 10.1016/j.ijpe.2023.109102
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527323003341
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ijpe.2023.109102?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:eee:proeco:v:268:y:2024:i:c:s0925527323003341. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.