A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion |
| |
| Affiliation: | 1. School of Automation, Wuhan University of Technology, Wuhan 430070, PR China;2. School of Economic and Management, Southwest Jiaotong University, Chengdu 610031, PR China;1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China;2. Collaborative Innovation Center of Novel Software Technology and Industrialization, Nanjing, China;1. State Key Laboratory for Manufacturing Systems Engineering and Systems Engineering Institute, Xi''an Jiaotong University, Xi''an 710049, PR China;2. School of Sciences, Guizhou Institute of Technology, Guiyang 550003, PR China |
| |
| Abstract: | This paper investigates the limited-buffer permutation flow shop scheduling problem (LBPFSP) with the makespan criterion. A hybrid variable neighborhood search (HVNS) algorithm hybridized with the simulated annealing algorithm is used to solve the problem. A method is also developed to decrease the computational effort needed to implement different types of local search approaches used in the HVNS algorithm. Computational results show the higher efficiency of the HVNS algorithm as compared with the state-of-the-art algorithms. In addition, the HVNS algorithm is competitive with the algorithms proposed in the literature for solving the blocking flow shop scheduling problem (i.e., LBPFSP with zero-capacity buffers), and finds 54 new upper bounds for the Taillard's benchmark instances. |
| |
| Keywords: | Scheduling Limited-buffer permutation flow shop Makespan Variable neighborhood search Simulated annealing algorithm Blocking flow shop |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
