Using artificial bee colony algorithm for permutation flow shop scheduling problem under makespan criterion

In this paper, a modified artificial bee colony algorithm is proposed to solve the permutation flow shop scheduling problem with makespan criterion. Originally developed for numerical optimisation, local search techniques are integrated into the algorithm to solve flow shop problems. Carlier and Reeves test problems from the literature are used to compare the performance of the algorithm against the best known solutions, NEH and with different meta-heuristic techniques. It is seen that for all the Carlier’s instances, proposed algorithm is able to find the best solutions, whereas for the Reeves’s cases best solutions of 13 problems from a total of 21 are found. Also, a new best solution is found for the Rec23 instance. Finally, statistical analyses are done to evaluate the proposed algorithm’s performance.

[1]  João Vitor Moccellin,et al.  A New Heuristic Method for the Permutation Flow Shop Scheduling Problem , 1995 .

[2]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

[3]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2007, GECCO '07.

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

[5]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

[6]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[7]  Bin Jiao,et al.  A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan , 2006, Appl. Math. Comput..

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

[9]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

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

[11]  Jacques Carlier,et al.  Ordonnancements à contraintes disjonctives , 1978 .

[12]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[13]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[14]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[15]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[16]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

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

[18]  Bo Liu,et al.  An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[19]  Jose M. Framiñan,et al.  Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .

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

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

[22]  Francisco Herrera,et al.  A study on the use of statistical tests for experimentation with neural networks: Analysis of parametric test conditions and non-parametric tests , 2007, Expert Syst. Appl..

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

[24]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

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

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

[27]  Liang Gao,et al.  A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem , 2011, Expert Syst. Appl..

[28]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

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

[30]  Dervis Karaboga,et al.  Artificial bee colony algorithm for large-scale problems and engineering design optimization , 2012, J. Intell. Manuf..

[31]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[32]  Kenji Itoh,et al.  Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge , 1995 .

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

[34]  S. Ponnambalam,et al.  A TSP-GA multi-objective algorithm for flow-shop scheduling , 2004 .

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

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

[37]  Xin-She Yang,et al.  Solving hybrid flow shop scheduling problems using bat algorithm , 2013 .

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

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

[40]  Guoji Zhang,et al.  Hybrid Genetic Algorithm for Flow Shop Scheduling Problem , 2010 .

[41]  M. Sayadi,et al.  A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems , 2010 .

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

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

[44]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops , 2011, Inf. Sci..

[45]  Mehmet Sevkli,et al.  Differential Evolution Algorithm for Permutation Flowshop Sequencing Problem with Makespan Criterion , 2004 .

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

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

[48]  Eugeniusz Nowicki,et al.  Some aspects of scatter search in the flow-shop problem , 2006, Eur. J. Oper. Res..

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