A modified cuckoo search algorithm for flow shop scheduling problem with blocking

This paper presents a Modified Cuckoo Search (MCS) algorithm for solving flow shop scheduling problem with blocking to minimize the makespan. To handle the discrete variables of the job scheduling problem, the smallest position value (SPV) rule is used to convert continuous solutions into discrete job permutations. The Nawaz-Enscore-Ham (NEH) heuristic method is utilized for generating high quality initial solutions. Moreover, two frequently used swap and insert operators are employed for enhancing the local search. To verify the performance of the proposed MCS algorithm, experiments are conducted on Taillard's benchmark set. Results show that MCS performs better than the standard CS and some previous algorithms proposed in the literature.

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

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

[3]  Michael Pinedo,et al.  Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..

[4]  Xin-She Yang,et al.  Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan , 2014, Appl. Soft Comput..

[5]  Ponnuthurai N. Suganthan,et al.  A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems , 2010, Comput. Oper. Res..

[6]  Quan-Ke Pan,et al.  An improved artificial bee colony algorithm for the blocking flowshop scheduling problem , 2012 .

[7]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

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

[9]  Zhijian Wu,et al.  Enhanced opposition-based differential evolution for solving high-dimensional continuous optimization problems , 2011, Soft Comput..

[10]  M.M.A. Salama,et al.  Opposition-Based Differential Evolution , 2008, IEEE Transactions on Evolutionary Computation.

[11]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers , 2009, Comput. Oper. Res..

[12]  Chelliah Sriskandarajah,et al.  Minimizing Cycle Time in a Blocking Flowshop , 2000, Oper. Res..

[13]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

[14]  Minghao Yin,et al.  A hybrid cuckoo search via Lévy flights for the permutation flow shop scheduling problem , 2013 .

[15]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

[16]  Xianpeng Wang,et al.  A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking , 2012, Appl. Soft Comput..

[17]  Ling Wang,et al.  Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer , 2011 .

[18]  Xin-She Yang,et al.  Engineering optimisation by cuckoo search , 2010, Int. J. Math. Model. Numer. Optimisation.

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

[20]  Débora P. Ronconi,et al.  A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..

[21]  Zhijian Wu,et al.  Enhancing particle swarm optimization using generalized opposition-based learning , 2011, Inf. Sci..

[22]  Mariappan Kadarkarainadar Marichelvam,et al.  An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems , 2012, Int. J. Bio Inspired Comput..

[23]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[24]  Mehmet Fatih Tasgetiren,et al.  Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms , 2010, Expert Syst. Appl..

[25]  Józef Grabowski,et al.  Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..

[26]  Yun-Chia Liang,et al.  Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem , 2006 .