Deep Reinforcement Learning Based Optimization Algorithm for Permutation Flow-Shop Scheduling
Zixiao Pan, Ling Wang, Jingjing Wang et al. · IEEE Transactions on Emerging Topics in Computational Intelligence · 2021
As a new analogy paradigm of human learning process, reinforcement learning (RL) has become an emerging topic in computational intelligence (CI). The synergy between the RL and CI is an emerging way to develop efficient solution algorithms for solving complex combinatorial optimization (CO) problems like machine scheduling problem. In this paper, we proposed an efficient optimization algorithm based on Deep RL for solving permutation flow-shop scheduling problem (PFSP) to minimize the maximum completion time. Firstly, a new deep neural network (PFSPNet) is designed for the PFSP to achieve the end-to-end output without limitation of problem sizes. Secondly, an actor-critic method of RL is used to train the PFSPNet without depending on the collection of high-quality labelled data. Thirdly, an improvement strategy is designed to refine the solution provided by the PFSPNet. Simulation results and statistical comparison show that the proposed optimization algorithm based on deep RL can obtain better results than the existing heuristics in similar computational time for solving the PFSP.
Cited by 126 works. doi:10.1109/tetci.2021.3098354
Authors
References
- Adam: A Method for Stochastic Optimization
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- The Complexity of Flowshop and Jobshop Scheduling
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
- Benchmarks for basic scheduling problems
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Recent Trends in Deep Learning Based Natural Language Processing [Review Article]
- Resource Management with Deep Reinforcement Learning
- Learning Combinatorial Optimization Algorithms over Graphs
- Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles