ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

A modified multi-agent proximal policy optimization algorithm for multi-objective dynamic partial-re-entrant hybrid flow shop scheduling problem

Wu, Jiawei; Liu, Yong*univ shanghai sci & technol
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE2025-1-15DOI: 10.1016/j.engappai.2024.109688
1被引2阅读
引用收藏
分享

摘要

This paper extends a novel model for modern flexible manufacturing systems: the multi-objective dynamic partial-re-entrant hybrid flow shop scheduling problem (MDPR-HFSP). The model considers partial-re-entrant processing, dynamic disturbance events, green manufacturing demand, and machine workload. Despite advancements in applying deep reinforcement learning to dynamic workshop scheduling, current methods face challenges in training scheduling policies for partial-re-entrant processing constraints and multiple manufacturing objectives. To solve the MDPR-HFSP, we propose a modified multi-agent proximal policy optimization (MMAPPO) algorithm, which employs a routing agent (RA) for machine assignment and a sequencing agent (SA) for job selection. Four machine assignment rules and four job selection rules are integrated to choose optimum actions for RA and SA at rescheduling points. In addition, reward signals are created by combining objective weight vectors with reward vectors, and training parameters under each weight vector are saved to flexibly optimize three objectives. Furthermore, we design an adaptive trust region clipping method to improve the constraint of the proximal policy optimization algorithm on the differences between new and old policies by introducing the Wasserstein distance. Moreover, we conduct comprehensive numerical experiments to compare the proposed MMAPPO algorithm with nine composite scheduling rules and the basic multi-agent proximal policy optimization algorithm. The results demonstrate that the proposed MMAPPO algorithm is more effective in solving the MDPR-HFSP and achieves superior convergence and diversity in solutions. Finally, a semiconductor wafer manufacturing case is resolved by the MMAPPO, and the scheduling solution meets the responsive requirement.

学科与关键词

关键词
Partial-re-entrant hybrid flow shopDynamic schedulingDeep reinforcement learningMulti-agentProximal policy optimizationMulti-objective optimization
相关
加载中…
  • Real-Time Scheduling for Dynamic Partial-No-Wait Multiobjective Flexible Job Shop by Deep Reinforcement Learning
    Luo, Shu; Zhang, Linxuan*; Fan, YushunIEEE Transactions on Automation Science and Engineering, 2022, 19(4): 3020-3038.被引 89
  • Multi-policy deep reinforcement learning for multi-objective multiplicity flexible job shop scheduling
    Ding, Linshan; Guan, Zailin; Rauf, Mudassar; Yue, Lei*Swarm and Evolutionary Computation, 2024, 87: 101550.被引 9
  • Deep reinforcement learning for dynamic distributed job shop scheduling problem with transfers
    Lei, Yong; Deng, Qianwang*; Liao, Mengqi; Gao, ShuochengEXPERT SYSTEMS WITH APPLICATIONS, 2024, 251: 123970.被引 4
查看全部 →

发表信息

论文状态
公开发表
期刊
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
发表日期
2025-01-15
卷期
第 140 卷
页码
109688
DOI
10.1016/j.engappai.2024.109688
语言
ENGLISH
成果收录
SCIE
资助标注
Ministry of Education, Humani-ties and Social Sciences Youth Fund [21YJC630087]; Shanghai Philosophy and Social Science Planning Project [2019BGL014]

作者

  • W

    Wu, Jiawei (第一作者)

    univ shanghai sci & technol

  • L

    Liu, Yong (通讯)

    univ shanghai sci & technol

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417