Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem

This paper presents a particle swarm optimization algorithm (PSO) to solve the permutation flowshop sequencing problem (PFSP) with makespan criterion. Simple but very efficient local search based on the variable neighborhood search (VNS) is embedded in the PSO algorithm to solve the benchmark suites in the literature. The results are presented and compared to the best known approaches in the literature. Ultimately, a total of 195 out of 800 best-known solutions in the literature is improved by the VNS version of the PSO algorithm.

[1]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[2]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[3]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[4]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[5]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[6]  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.

[7]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[8]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[9]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[10]  M. A. Abido,et al.  Optimal power flow using particle swarm optimization , 2002 .

[11]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[12]  L. Darrell Whitley,et al.  Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance , 2002, INFORMS J. Comput..

[13]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[14]  Russell C. Eberhart,et al.  Swarm intelligence for permutation optimization: a case study of n-queens problem , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[15]  Mehmet Fatih Tasgetiren,et al.  Particle swarm optimization algorithm for single machine total weighted tardiness problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[16]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[17]  Godfrey C. Onwubolu,et al.  Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization , 2004 .