arrow
Return

Dynamic Jobshop Scheduling Algorithm Based on Deep Q Network

delete2021-01-01
delete47
delete
OA
AI
Y
Yejian Zhao
Y
Yanhong Wang *
Y
Yuanyuan Tan
J
Jun Zhang
H
Hongxia Yu
DOI:10.1109/ACCESS.2021.3110242delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
Heuristic algorithms
Job shop scheduling
Scheduling
Dynamic scheduling
Scheduling algorithms
Production
Dispatching
Dynamic scheduling
deep Q network
deep reinforcement learning
dispatching rules
job shop scheduling

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

S
Shenyang University of Technology
Scholars:
5.0K
Papers: 3.3K
Citations: 3.4K