A Dynamic Multi-swarm Particle Swarm Optimizer for blocking flow shop scheduling

This paper presents a Dynamic Multi-Swarm Particle Swarm Optimizer (DMS-PSO) for solving blocking flow shop scheduling problems with makespan criterion. Using small swarms and a regrouping schedule, DMS-PSO has a better global search ability. In order to improve its local search ability, a special designed local search phase is added into the algorithm. The experimental results indicate that the proposed DMS-PSO has a better performance on the blocking flow shop scheduling problems comparing some other algorithms.

[1]  Jing J. Liang,et al.  Dynamic multi-swarm particle swarm optimizer with local search , 2005, 2005 IEEE Congress on Evolutionary Computation.

[2]  Chelliah Sriskandarajah,et al.  Minimizing Cycle Time in a Blocking Flowshop , 2000, Oper. Res..

[3]  Débora P. Ronconi A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..

[4]  Ponnuthurai N. Suganthan,et al.  A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems , 2010, Comput. Oper. Res..

[5]  Débora P. Ronconi,et al.  Some heuristic algorithms for total tardiness minimization in a flowshop with blocking , 2009 .

[6]  Michael Pinedo,et al.  Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..

[7]  Tapan P. Bagchi,et al.  Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .

[8]  Jing J. Liang,et al.  Dynamic multi-swarm particle swarm optimizer , 2005, Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005..

[9]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[10]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[11]  É. Taillard Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[12]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[13]  Józef Grabowski,et al.  Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..

[14]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

[15]  Débora P. Ronconi A note on constructive heuristics for the flowshop problem with blocking , 2004 .

[16]  Rainer Leisten Flowshop sequencing problems with limited buffer storage , 1990 .

[17]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[18]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[19]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers , 2009, Comput. Oper. Res..

[20]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics , 2005, Eur. J. Oper. Res..