Interactive Operation Agent Scheduling Method for Job Shop Based on Deep Reinforcement Learning

被引:1
|
作者
Chen R. [1 ]
Li W. [1 ,2 ]
Wang C. [1 ]
Yang H. [1 ]
机构
[1] School of Mechanical and Electric Engineering, Soochow University, Suzhou
[2] School of Management, Shanghai University, Shanghai
来源
Jixie Gongcheng Xuebao/Journal of Mechanical Engineering | 2023年 / 59卷 / 12期
关键词
deep reinforcement learning; double DQN; Job shop scheduling; machine failure; operation agents;
D O I
10.3901/JME.2023.12.078
中图分类号
学科分类号
摘要
Job shop scheduling problem(JSSP) is difficult to obtain high-quality solution quickly due to NP hard attribute, and rescheduling occurs frequently due to the random disturbances of production scenarios. Based on deep reinforcement learning, a novel interactive operation agent(IOA) scheduling model framework is proposed. Through analysis of the constraint relationship between process route and processing equipment among operations, the processing processes in job shop are constructed as operation agents. The interaction mechanism between operation agents is designed, and each agent can interact with each other and update its own feature vector according to their relationship. Further, a deep neural network is constructed based on the operation characteristics and the earliest processing time to fit the action value function. As a result, the scheduling model can generate the scheduling strategy according to the system state and the characteristics of each operation agent. Double DQN algorithm is used to train IOA scheduling model, and the introduction of empirical playback mechanism effectively breaks the correlation between sequence training samples. The trained model can quickly generate high-quality scheduling scheme, and effectively execute rescheduling production strategy in case of machine failure. Experimental results show that the proposed IOA scheduling method is superior to greedy algorithm and heuristic scheduling rules, and has good robustness and generalization ability. © 2023 Editorial Office of Chinese Journal of Mechanical Engineering. All rights reserved.
引用
收藏
页码:78 / 88
页数:10
相关论文
共 31 条
  • [1] ZHANG J, DING G, ZOU Y, Et al., Review of job shop scheduling research and its new perspectives under Industry 4.0[J], Journal of Intelligent Manufacturing, 30, pp. 1809-1830, (2017)
  • [2] XIAO Shichang, WU Zigao, SUN Shudong, Et al., Research on the dual-resource constrained robust job shop scheduling problems[J], Journal of Mechanical Engineering, 57, 4, pp. 227-239, (2021)
  • [3] XANTHOPOULOS A, KOULOURIOTIS D E., Cluster analysis and neural network-based metamodeling of priority rules for dynamic sequencing[J], Journal of Intelligent Manufacturing, 29, 1, pp. 69-91, (2018)
  • [4] WANG C, JIANG P., Manifold learning based rescheduling decision mechanism for recessive disturbances in RFID-driven job shops[J], Journal of Intelligent Manufacturing, 29, 7, pp. 1485-1500, (2018)
  • [5] PENG B, CHENG T., A tabu search/path relinking algorithm to solve the job shop scheduling problem[J], Computers & Operations Research, 53, pp. 154-164, (2015)
  • [6] CROCE F, TADEI R, VOLTA G., A genetic algorithm for the job shop problem[J], Computers & Operations Research, 22, 1, pp. 15-24, (1995)
  • [7] WERNER F, WINKLER A., Insertion techniques for the heuristic solution of the job shop problem[J], Discrete Applied Mathematics, 58, 2, pp. 191-211, (1995)
  • [8] ADAMS J, BALAS E, ZAWACK D., The shifting bottleneck procedure for job shop scheduling[J], Management Science, 34, 3, pp. 391-401, (1988)
  • [9] ZHANG W, WEN J B, ZHU Y C,, Et al., Multi-objective scheduling simulation of flexible job-shop based on multi-population genetic algorithm[J], International Journal of Simulation Modelling, 16, 2, pp. 313-321, (2017)
  • [10] ZHAO Shikui, Research on path relinking based on non-delay scheduling and backtracking tabu search algorithm of job shop scheduling problem, Journal of Mechanical Engineering, 57, 14, pp. 291-303, (2021)