Journal of System Simulation ›› 2021, Vol. 33 ›› Issue (12): 2782-2791.doi: 10.16182/j.issn1004731x.joss.21-FZ0774

Previous Articles     Next Articles

Brief Review on Applying Reinforcement Learning to Job Shop Scheduling Problems

Wang Xiaohan1,2, Zhang Lin1,2, Ren Lei1,2, Xie Kunyu1,2, Wang Kunyu1,2, Ye Fei1,2, Chen Zhen1,2   

  1. 1. Beihang University, Beijing 100191, China;
    2. Engineering Research Center of Complex Product Advanced Manufacturing Systems, Ministry of Education, Beijing 100191, China
  • Received:2021-05-10 Revised:2021-07-29 Online:2021-12-18 Published:2022-01-13

Abstract: Reinforcement Learning (RL) achieves lower time response and better model generalization in Job Shop Scheduling Problem (JSSP). To explain the current overall research status of JSSP based on RL, summarize the current scheduling framework based on RL, and lay the foundation for follow-up research, the backgrounds of JSSP and RL are introduced. Two simulation techniques commonly used in JSSP are analyzed and two commonly used frameworks for RL to solve JSSP are given. In addition, some existing challenges are pointed out, and related research progress is introduced from three aspects: direct scheduling, feature representation-based scheduling, and parameter search-based scheduling.

Key words: reinforcement learning application, job shop scheduling problem, graph neural network, combinatorial optimization, deep learning, feature representation

CLC Number: