A hybrid discrete particle swarm optimization for dual-resource constrained job shop scheduling with resource flexibility |
| |
| Authors: | Jing Zhang Wanliang Wang Xinli Xu |
| |
| Affiliation: | 1.Department of Computer and Information Technology,Zhejiang Police College,Hangzhou,People’s Republic of China;2.College of Computer Science and Technology,Zhejiang University of Technology,Hangzhou,People’s Republic of China |
| |
| Abstract: | In this paper, a novel hybrid discrete particle swarm optimization algorithm is proposed to solve the dual-resource constrained job shop scheduling problem with resource flexibility. Particles are represented based on a three-dimension chromosome coding scheme of operation sequence and resources allocation. Firstly, a mixed population initialization method is used for the particles. Then a discrete particle swarm optimization is designed as the global search process by taking the dual-resources feature into account. Moreover, an improved simulated annealing with variable neighborhoods structure is introduced to improve the local searching ability for the proposed algorithm. Finally, experimental results are given to show the effectiveness of the proposed algorithm. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
