Particle Swarm Optimization Algorithm for Makespan and Maximum Lateness Minimization in Permutation Flowshop Sequencing Problem

In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the permutaion flowshop sequencing problem (PFSP) with the objectives of minimizing makespan and maximum lateness of jobs, respectively. Simple but very efficient local search based on variable neighborhood search (VNS) is embedded in the particle swarm optimization algorithm to solve the well known benchmark suites in the literature. The proposed PSO algorithm is applied to both 40 benchmark problems for makespan criterion and 160 problem instances for maximum lateness criterion provided by Demirkol et al. (European Journal of Operational Research, 109 (1998) 137-141). For both makespan and maximum lateness criteria, solution quality is evaluated according to the upper bounds provided by Demirkol. For makespan criterion, all of the upper bounds reported by Demirkol are improved while for maximum lateness criterion, a total of 155 out of 160 upper bounds is improved by the proposed VNS version of the PSO algorithm.

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

[2]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[3]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[4]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[5]  Yoshikazu Fukuyama,et al.  A particle swarm optimization for reactive power and voltage control considering voltage security assessment , 2000 .

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

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

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

[9]  Jiyin Liu,et al.  Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..

[10]  Ali Allahverdi,et al.  Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness , 1996, Comput. Oper. Res..

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

[12]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

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

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

[15]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[16]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

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

[18]  Mehmet Fatih Tasgetiren,et al.  Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem , 2004, ANTS Workshop.

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

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

[21]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[22]  D. Chaudhuri,et al.  An efficient heuristic approach to the scheduling of jobs in a flowshop , 1992 .

[23]  Colin R. Reeves,et al.  Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .

[24]  Tapan Sen,et al.  Job lateness in a two-machine flowshop with setup times separated , 1991, Comput. Oper. Res..

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

[26]  Jose M. Framiñan,et al.  Production , Manufacturing and Logistics Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation , 2002 .

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

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

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

[30]  Thomas Sttzle,et al.  Applying iterated local search to the permutation ow shop problem , 1998 .

[31]  Ali Allahverdi,et al.  Dual criteria scheduling on a two-machine flowshop subject to random breakdowns , 1998 .

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