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

Dynamic Jobshop Scheduling Algorithm Based on Deep Q Network

Zhao, Yejian; Wang, Yanhong*; Tan, Yuanyuan; Zhang, Jun; Yu, Hongxiashenyang univ technol
IEEE Access2021DOI: 10.1109/ACCESS.2021.3110242
36被引12阅读
引用收藏
分享

摘要

Jobshop scheduling is a classic instance in the field of production scheduling. Solving and optimizing the scheduling problem of the jobshop can greatly reduce the production cost of the workshop and improve the processing efficiency, thereby improving the market competitiveness of the manufacturing enterprises. In order to make decisions on the complex dynamic scheduling process more accurately and simplify the solution process, the jobshop scheduling problem can be transformed into a reinforcement learning problem based on the Markov decision process. The performance of the adaptive scheduling algorithm in a dynamic manufacturing environment is improved based on the Deep Q Network (DQN). In the proposed scheduling algorithm, five state features of continuous value ranges are designed for input to a Deep Neural Network (DNN), as well as ten well-known heuristic dispatching rules are selected as the action set of the DQN. In the proposed scheduling algorithm, the target network and the prediction network are used to train the parameters. An action selection strategy based on the "softmax" function is designed in DQN. It selects dispatching rules with the largest action value as the execution action, thereby solving the problem that the suboptimal action value is greater than the optimal action Q value in the early learning stage. Furthermore, the non-optimal action is selected with a greater probability in the later learning stage. Ten benchmark jobshop test instances called "LA" used as simulation objects and operated in a simulation environment composed of Python. The simulation results confirm that the proposed scheduling algorithm based on DQN has better performance and universality than a single dispatching rule or traditional Q learning algorithm.

学科与关键词

关键词
Heuristic algorithmsJob shop schedulingSchedulingDynamic schedulingScheduling algorithmsProductionDispatchingdeep Q networkdeep reinforcement learningdispatching rulesjob shop scheduling
相关
加载中…
  • Research on Adaptive Job Shop Scheduling Problems Based on Dueling Double DQN
    Han, Bao-An*; Yang, Jian-JunIEEE Access, 2020, 8: 186474-186495.被引 107
  • 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
  • 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
查看全部 →

发表信息

论文状态
公开发表
期刊
IEEE Access
发表日期
2021
卷期
第 9 卷
页码
122995-123011
DOI
10.1109/ACCESS.2021.3110242
语言
ENGLISH
期刊收录
NSL
期刊等级
3区
成果收录
SCIE
资助标注
Liaoning Provincial Key Research and Development Plan of China [2020JH2/10100041]; Youth Fund of the National Natural Science Foundation of China [62003221]

作者

  • Z

    Zhao, Yejian (第一作者)

    shenyang univ technol

  • W

    Wang, Yanhong (通讯)

    shenyang univ technol

查看全部 5 位作者收起作者
  • T

    Tan, Yuanyuan

    shenyang univ technol

  • Z

    Zhang, Jun

    shenyang univ technol

  • Y

    Yu, Hongxia

    shenyang univ technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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