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

Research on Adaptive Job Shop Scheduling Problems Based on Dueling Double DQN

Han, Bao-An*; Yang, Jian-Jun北京航空航天大学
IEEE Access2020DOI: 10.1109/ACCESS.2020.3029868
107被引2阅读
引用收藏
分享

摘要

Traditional approaches for job shop scheduling problems are ill-suited to deal with complex and changeable production environments due to their limited real-time responsiveness. Based on disjunctive graph dispatching, this work proposes a deep reinforcement learning (DRL) framework, that combines the advantages of real-time response and flexibility of a deep convolutional neural network (CNN) and reinforcement learning (RL), and learns behavior strategies directly according to the input manufacturing states, thus is more appropriate for practical order-oriented manufacturing problems. In this framework, a scheduling process using a disjunction graph is viewed as a multi-stage sequential decision-making problem and a deep CNN is used to approximate the state-action value. The manufacturing states are expressed as multi-channel images and input into the network. Various heuristic rules are used as available actions. By adopting the dueling double Deep Q-network with prioritized replay (DDDQNPR), the RL agent continually interacts with the scheduling environment through trial and error to obtain the best policy of combined actions for each decision step. Static computational experiments are performed on 85 JSSP instances from the well-known OR-Library. The results indicate that the proposed algorithm can obtain optimal solutions for small scale problems, and performs better than any single heuristic rule for large scale problems, with performances comparable to genetic algorithms. To prove the generalization and robustness of our algorithm, the instances with random initial states are used as validation sets during training to select the model with the best generalization ability, and then the performance of the trained policy on scheduling instances with different initial states is tested. The results show that the agent is able to get better solutions adaptively. Meanwhile, some studies on dynamic instances with random processing time are performed and experiment results indicate that out method can achieve comparable performances in dynamic environment in the short run.

学科与关键词

关键词
Job shop schedulingDynamic schedulingHeuristic algorithmsAdaptive schedulingReal-time systemsconvolutional neural networkdeep reinforcement learningdueling double DQNjob shop scheduling problem (JSSP)
相关
加载中…
  • Dynamic Jobshop Scheduling Algorithm Based on Deep Q Network
    Zhao, Yejian; Wang, Yanhong*; Tan, Yuanyuan; Zhang, Jun; Yu, HongxiaIEEE Access, 2021, 9: 122995-123011.被引 36
  • 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
  • An end-to-end deep reinforcement learning method based on graph neural network for distributed job-shop scheduling problem
    Huang, Jiang-Ping; Gao, Liang; Li, Xin-Yu*EXPERT SYSTEMS WITH APPLICATIONS, 2024, 238: 121756.被引 13
查看全部 →

发表信息

论文状态
公开发表
期刊
IEEE Access
发表日期
2020
卷期
第 8 卷
页码
186474-186495
DOI
10.1109/ACCESS.2020.3029868
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
3区
成果收录
SCIE
资助标注
Beijing Key Laboratory of Digital Design and Manufacturing; National High Technology Research and Development Program(863) of China [2012AA040907]; postgraduate innovation practice base of the modern design and advanced manufacturing technology for complex products in Beihang University

作者

  • H

    Han, Bao-An (通讯) (第一作者)

    beihang univ

  • Y

    Yang, Jian-Jun

    beihang univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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