A discrete version of particle swarm optimization for flowshop scheduling problems

作者：Liao Ching Jong^*; Tseng Chao Tang; Luarn Pin

来源：Computers & Operations Research, 2007, 34(10): 3099-3111.

DOI：10.1016/j.cor.2005.11.017

• scheduling
• particle swarm optimization
• metaheuristic

Particle swarm optimization (PSO) is a novel metaheuristic inspired by the flocking behavior of birds. The applications of PSO to scheduling problems are extremely few. In this paper, we present a PSO algorithm, extended from discrete PSO, for flowshop scheduling. In the proposed algorithm, the particle and the velocity are redefined, and an efficient approach is developed to move a particle to the new sequence. To verify the proposed PSO algorithm, comparisons with a continuous PSO algorithm and two genetic algorithms are made. Computational results show that the proposed PSO algorithm is very competitive. Furthermore, we incorporate a local search scheme into the proposed algorithm, called PSO-LS. Computational results show that the local search can be really guided by PSO in our approach. Also, PSO-LS performs well in flowshop scheduling with total flow time criterion, but it requires more computation times.

• 出版日期2007-10