A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks

The multistage hybrid flow-shop scheduling problem with multiprocessor tasks has been found in many practical situations. Due to the essential complexity of the problem, many researchers started to apply metaheuristics to solve the problem. In this paper, we address the problem by using particle swarm optimization (PSO), a novel metaheuristic inspired by the flocking behaviour of birds. The proposed PSO algorithm has several features, such as a new encoding scheme, an implementation of the best velocity equation and neighbourhood topology among several different variants, and an effective incorporation of local search. To verify the PSO algorithm, computational experiments are conducted to make a comparison with two existing genetic algorithms (GAs) and an ant colony system (ACS) algorithm based on the same benchmark problems. The results show that the proposed PSO algorithm outperforms all the existing algorithms for the considered problem.

[1]  Ching-Jong Liao,et al.  A case study in a two-stage hybrid flow shop with setup time and dedicated machines , 2003 .

[2]  Henryk Krawczyk,et al.  An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems , 1985, IEEE Transactions on Computers.

[3]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[4]  Marius M. Solomon,et al.  A computational study of heuristics for two-stage flexible flowshops , 1996 .

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

[6]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[7]  Jianer Chen,et al.  General Multiprocessor Task Scheduling , 1999 .

[8]  J. C. Bean.  Genetics and random keys for sequencing amd optimization , 1993 .

[9]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[10]  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).

[11]  Ceyda Oguz,et al.  Scheduling multiprocessor tasks in a two-stage flow-shop environment , 1997 .

[12]  J R Saunders,et al.  A particle swarm optimizer with passive congregation. , 2004, Bio Systems.

[13]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

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

[15]  Andries Petrus Engelbrecht,et al.  Cooperative learning in neural networks using particle swarm optimizers , 2000, South Afr. Comput. J..

[16]  Ceyda Oguz,et al.  Hybrid flow-shop scheduling problems with multiprocessor task systems , 2004, Eur. J. Oper. Res..

[17]  Maciej Drozdowski,et al.  Scheduling multiprocessor tasks -- An overview , 1996 .

[18]  Shiyou Yang,et al.  A particle swarm optimization-based method for multiobjective design optimizations , 2005, IEEE Transactions on Magnetics.

[19]  Michael Pinedo,et al.  Current trends in deterministic scheduling , 1997, Ann. Oper. Res..

[20]  Zhihui Xue,et al.  Review of Scheduling computer and manufacturing processes by Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Guenter Schmidt, Jan Weglarz Springer-Verlag 2001 , 2003 .

[21]  Funda Sivrikaya-Serifoglu,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach , 2004, J. Oper. Res. Soc..

[22]  Kwok-Wo Wong,et al.  A novel particle swarm optimizer with time-delay , 2007, Appl. Math. Comput..

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

[24]  Mehmet Sevkli,et al.  Particle Swarm Optimization Algorithm for Makespan and Maximum Lateness Minimization in Permutation Flowshop Sequencing Problem , 2004 .

[25]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[26]  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).

[27]  Shih-Wei Lin,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach , 2006 .

[28]  Ceyda Oguz,et al.  A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks , 2005, J. Sched..

[29]  Fawaz S. Al-Anzi,et al.  A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application , 2006, Comput. Oper. Res..

[30]  J. Gupta,et al.  Schedules for a two-stage hybrid flowshop with parallel machines at the second stage , 1991 .

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

[32]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[33]  Mohamed Haouari,et al.  Heuristic algorithms for the two-stage hybrid flowshop problem , 1997, Oper. Res. Lett..

[34]  Chung-Lun Li,et al.  A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis , 2002, Oper. Res. Lett..

[35]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[36]  Abdelhakim Artiba,et al.  A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan , 1998, Eur. J. Oper. Res..