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

Deep reinforcement learning for dynamic flexible job shop scheduling problem considering variable processing times

Zhang, Lu; Feng, Yi; Xiao, Qinge; Xu, Yunlang; Li, Di; Yang, Dongsheng; Yang, Zhile*东北大学; 复旦大学; 中国科学院
JOURNAL OF MANUFACTURING SYSTEMS2023-12DOI: 10.1016/j.jmsy.2023.09.009
1被引6阅读
引用收藏
分享

摘要

In recent years, the uncertainties and complexity in the production process, due to the boosted customized requirements, has dramatically increased the difficulties of Dynamic Flexible Job Shop Scheduling (DFJSP). This paper investigates a new DFJSP model taking into account the minimum completion time under the condition of machine processing time uncertainty, e.t. VPT-FJSP problem. In the formulated VPT-FJSP process, each workpiece needs to be processed by required machine at a certain time slot where Markov decision process (MDP) and reinforcement learning methods are adopted to solve VPT-FJSP. The agent designed in this paper employs the Proximal Policy Optimization(PPO) algorithm in deep reinforcement learning, which includes the Actor-Critic network. The input of the network is to extract the processing information matrix and to embed some advanced states in the workshop by graph neural network, which enables the agent to learn the complete state of the environment. Finally, we train and test the proposed framework on the canonical FJSP benchmark, and the experimental results show that our framework can make agent better than genetic algorithm and ant colony optimization in most cases, 94.29% of static scheduling. It is also shown superiority compared to the scheduling rules in dynamic environment and has demonstrated strong robustness in solving VPT-FJSP. Furthermore, this study conducted tests to assess the generalization capability of the agent on VPT-FJSP at different scales. In terms of exploring Makespan minimization, the agent outperformed four priority scheduling rules. These results indicate that the proposed dynamic scheduling framework and PPO algorithm are more effective in achieving superior solutions.

学科与关键词

关键词
Dynamic scheduling flexible job shop problemDeep reinforcement learningVariable processing timesProximal policy optimizationMakespan
相关
加载中…
  • A multi-action deep reinforcement learning framework for flexible Job-shop scheduling problem
    Lei, Kun; Guo, Peng*; Zhao, Wenchao; Wang, Yi; Qian, Linmao; Meng, Xiangyin; Tang, LianshengEXPERT SYSTEMS WITH APPLICATIONS, 2022, 205: 117796.被引 107
  • Solving flexible job shop scheduling problems via deep reinforcement learning
    Yuan, Erdong; Wang, Liejun*; Cheng, Shuli; Song, Shiji; Fan, Wei; Li, YongmingEXPERT SYSTEMS WITH APPLICATIONS, 2024, 245: 123019.被引 11
  • Dynamic scheduling for flexible job shop using a deep reinforcement learning approach
    Gui, Yong; Tang, Dunbing*; Zhu, Haihua; Zhang, Yi; Zhang, ZequnCOMPUTERS & INDUSTRIAL ENGINEERING, 2023, 180: 109255.被引 46
查看全部 →

发表信息

论文状态
公开发表
期刊
JOURNAL OF MANUFACTURING SYSTEMS
发表日期
2023-12
卷期
第 71 卷
页码
257-273
DOI
10.1016/j.jmsy.2023.09.009
语言
ENGLISH
成果收录
SCIE
资助标注
National Key Research and Development Project, China [2018YFB1700500]; Natural Science Foundation of Guangdong Province, China [2020A1515110541]

作者

  • Z

    Zhang, Lu (第一作者)

    dalian univ technol

  • F

    Feng, Yi

    dalian univ technol

查看全部 7 位作者收起作者
  • X

    Xiao, Qinge

    chinese acad sci

  • X

    Xu, Yunlang

    fudan univ

  • L

    Li, Di

  • Y

    Yang, Dongsheng

    northeastern univ

  • Y

    Yang, Zhile (通讯)

    chinese acad sci

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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