A combinatorial particle swarm optimisation for solving permutation flowshop problems

The m-machine permutation flowshop problem PFSP with the objectives of minimizing the makespan and the total flowtime is a common scheduling problem, which is known to be NP-complete in the strong sense, when m>=3. This work proposes a new algorithm for solving the permutation FSP, namely combinatorial Particle Swarm Optimization. Furthermore, we incorporate in this heuristic an improvement procedure based on the simulated annealing approach. The proposed algorithm was applied to well-known benchmark problems and compared with several competing metaheuristics.

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

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

[3]  C. Rajendran.  Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

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

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[7]  G. B. McMahon,et al.  Flow-Shop Scheduling with the Branch-and-Bound Method , 1967, Oper. Res..

[8]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[9]  Ömer Kirca,et al.  A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems , 2002 .

[10]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[11]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

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

[13]  Johnny C. Ho,et al.  Flowshop sequencing with mean flowtime objective , 1995 .

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

[15]  Mohamed Ben-Daya,et al.  A tabu search approach for the flow shop scheduling problem , 1998, Eur. J. Oper. Res..

[16]  Hoon-Shik Woo,et al.  A heuristic algorithm for mean flowtime objective in flowshop scheduling , 1998, Comput. Oper. Res..

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

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

[19]  Z. A. Lomnicki.  A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .

[20]  Hamid Davoud Pour.  A new heuristic for the n-job, m-machine flow-shop problem , 2001 .

[21]  S. L. Velde.  Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .

[22]  S. Bansal.  Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach , 1977 .

[23]  Jatinder N. D. Gupta,et al.  Optimal Scheduling in a Multistage Flowshop , 1972 .

[24]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

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

[26]  Z. A. Lomnicki,et al.  Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .

[27]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

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

[29]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[30]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[31]  Chandrasekharan Rajendran,et al.  Two ant-colony algorithms for minimizing total flowtime in permutation flowshops , 2005, Comput. Ind. Eng..

[32]  Wei-Chang Yeh.  A new branch-and-bound approach for the n/2/flowshop/alphaF+betaCmax flowshop scheduling problem , 1999, Comput. Oper. Res..

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

[34]  S.M.A. Suliman,et al.  A two-phase heuristic approach to the permutation flow-shop scheduling problem , 2000 .

[35]  Jean-Marie Proth,et al.  Heuristic approaches for n/m/F/ ∑Ci scheduling problems , 1997 .

[36]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

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

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

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

[40]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

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