A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem

This paper deals with the permutation flow shop scheduling problem. The objective is to minimize the maximum completion time, or makespan. To solve this problem which has been proved to be strongly NP-hard, a combination between an ant colony algorithm, a heuristic algorithm and a local search procedure is proposed and presented. The hybrid approach is to use artificial ants to construct solutions by applying a stochastic greedy rule based on the Gupta's heuristic and pheromone trails. A local search is then performed to improve the performance quality of constructed solutions. Once all ants have terminated their generations, the pheromone trails are modified according to a global updating rule. The proposed algorithm is applied to benchmark problems taken from the literature and compared with other metaheuristics. Computational experiments are given to demonstrate the superiority of the algorithm in the quality of solution and CPU time.

[1]  Michael Pinedo,et al.  Planning and Scheduling in Manufacturing and Services , 2008 .

[2]  Bassem Jarboui,et al.  A combinatorial particle swarm optimisation for solving permutation flowshop problems , 2008, Comput. Ind. Eng..

[3]  Christos D. Tarantilis,et al.  Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm , 2009, Comput. Oper. Res..

[4]  C. Rajendran,et al.  An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops , 2006 .

[5]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

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

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

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

[9]  Subbarao Kambhampati,et al.  Planning and Scheduling , 1997, The Computer Science and Engineering Handbook.

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

[11]  Jose M. Framiñan,et al.  Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective , 2010, Comput. Oper. Res..

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

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

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

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

[16]  Subhash C. Sarin,et al.  A heuristic to minimize total flow time in permutation flow shop , 2009 .

[17]  Jatinder N. D. Gupta,et al.  Heuristic Algorithms for Multistage Flowshop Scheduling Problem , 1972 .

[18]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .

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

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

[21]  Jindong Zhang,et al.  The circular discrete particle swarm optimization algorithm for flow shop scheduling problem , 2010, Expert Syst. Appl..

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

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

[24]  Cengiz Kahraman,et al.  An Application Of Effective Genetic Algorithms For Solving Hybrid Flow Shop Scheduling Problems , 2008, Int. J. Comput. Intell. Syst..

[25]  Xiaoping Li,et al.  Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization , 2009, Eur. J. Oper. Res..

[26]  Mehmet Mutlu Yenisey,et al.  A multi-objective ant colony system algorithm for flow shop scheduling problem , 2010, Expert Syst. Appl..

[27]  Burak Eksioglu,et al.  A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods , 2008, Comput. Ind. Eng..

[28]  Edward F. Stafford,et al.  On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem , 1988 .

[29]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

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

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

[32]  Rainer Leisten,et al.  A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness , 2006 .

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

[34]  Dk Smith,et al.  Simulated annealing for the permutation flowshop problem , 1991 .

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

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

[37]  Lin-Yu Tseng,et al.  A hybrid genetic local search algorithm for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..

[38]  Mehmet Mutlu Yenisey,et al.  Ant colony optimization for multi-objective flow shop scheduling problem , 2008, Comput. Ind. Eng..

[39]  J. Grabowski,et al.  New block properties for the permutation flow shop problem with application in tabu search , 2001, J. Oper. Res. Soc..

[40]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

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

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

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

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

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

[46]  Ching-Jong Liao,et al.  An ant colony system for permutation flow-shop sequencing , 2004, Comput. Oper. Res..

[47]  Jerzy Kamburowski,et al.  An improved NEH heuristic to minimize makespan in permutation flow shops , 2008, Comput. Oper. Res..

[48]  Xavier Tort-Martorell,et al.  Comparing three-step heuristics for the permutation flow shop problem , 2010, Comput. Oper. Res..

[49]  Q. Wang,et al.  Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .

[50]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[51]  Xingsheng Gu,et al.  A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan ☆ , 2008 .

[52]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

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

[54]  Marcelo Seido Nagano,et al.  A Constructive Genetic Algorithm for Permutation Flowshop Scheduling Version 2 , 2007 .

[55]  Bertrand M. T. Lin,et al.  Development of new features of ant colony optimization for flowshop scheduling , 2008 .