IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v18y2026i7p3222-d1903329.html

Preference-Guided Reinforcement Learning for Dynamic Green Flexible Assembly Job Shop Scheduling with Learning–Forgetting Effects

Author

Listed:
  • Ruyi Wang

    (College of Computer Science and Cyber Security, Chengdu University of Technology, Chengdu 610059, China
    Sichuan Engineering Technology Research Center for Industrial Internet Intelligent Monitoring and Application, Chengdu University of Technology, Chengdu 610059, China)

  • Xiaojuan Liao

    (College of Computer Science and Cyber Security, Chengdu University of Technology, Chengdu 610059, China
    Sichuan Engineering Technology Research Center for Industrial Internet Intelligent Monitoring and Application, Chengdu University of Technology, Chengdu 610059, China)

  • Guangzhu Chen

    (College of Computer Science and Cyber Security, Chengdu University of Technology, Chengdu 610059, China
    Sichuan Engineering Technology Research Center for Industrial Internet Intelligent Monitoring and Application, Chengdu University of Technology, Chengdu 610059, China)

  • Yaxin Liu

    (College of Computer Science and Cyber Security, Chengdu University of Technology, Chengdu 610059, China
    Sichuan Engineering Technology Research Center for Industrial Internet Intelligent Monitoring and Application, Chengdu University of Technology, Chengdu 610059, China)

  • Leyuan Liu

    (School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China)

Abstract

With the evolution from Industry 4.0 to 5.0, flexible assembly scheduling must simultaneously address production efficiency, environmental sustainability, and human factors, while remaining adaptive to real-time disruptions. This study investigates the dynamic green scheduling problem in dual-resource Flexible Assembly Job Shops with worker learning and forgetting, aiming to minimize makespan and total energy consumption. To tackle this problem, a Hierarchical Dual-Agent Deep Reinforcement Learning algorithm (HAD-DRL) is proposed. The framework integrates a Heterogeneous Graph Neural Network to extract real-time workshop states and employs two collaborative agents, i.e., a high-level preference decision agent and a low-level scheduling execution agent. The upper agent dynamically adjusts the preference weights between economic and environmental objectives, while the lower agent generates corresponding scheduling actions. Unlike existing multi-agent methods that optimize a single objective at each step, HAD-DRL achieves adaptive coordination and balanced trade-offs among conflicting goals. Experimental results demonstrate that the proposed method outperforms heuristic and baseline DRL approaches in both objectives, validating its effectiveness and practical applicability for intelligent and sustainable manufacturing.

Suggested Citation

  • Ruyi Wang & Xiaojuan Liao & Guangzhu Chen & Yaxin Liu & Leyuan Liu, 2026. "Preference-Guided Reinforcement Learning for Dynamic Green Flexible Assembly Job Shop Scheduling with Learning–Forgetting Effects," Sustainability, MDPI, vol. 18(7), pages 1-31, March.
  • Handle: RePEc:gam:jsusta:v:18:y:2026:i:7:p:3222-:d:1903329
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/18/7/3222/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/18/7/3222/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:gam:jsusta:v:18:y:2026:i:7:p:3222-:d:1903329. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.