Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan

The multistage hybrid flow shop (HFS) scheduling problems are considered in this paper. Hybrid flowshop scheduling problems were proved to be NP-hard. A recently developed cuckoo search (CS) metaheuristic algorithm is presented in this paper to minimize the makespan for the HFS scheduling problems. A constructive heuristic called NEH heuristic is incorporated with the initial solutions to obtain the optimal or near optimal solutions rapidly in the improved cuckoo search (ICS) algorithm. The proposed algorithm is validated with the data from a leading furniture manufacturing company. Computational results show that the ICS algorithm outperforms many other metaheuristics.

[1]  Amir Hossein Gandomi,et al.  Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems , 2011, Engineering with Computers.

[2]  Philippe Baptiste,et al.  Solving hybrid flow shop problem using energetic reasoning and global operations , 2001 .

[3]  Wojciech Bozejko,et al.  Parallel tabu search algorithm for the hybrid flow shop problem , 2013, Comput. Ind. Eng..

[4]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[5]  John L. Hunsucker,et al.  Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment , 1994 .

[6]  Sankha Deb,et al.  Scheduling optimization of flexible manufacturing system using cuckoo search-based approach , 2013 .

[7]  Abdesslem Layeb,et al.  A novel quantum inspired cuckoo search for knapsack problems , 2011, Int. J. Bio Inspired Comput..

[8]  Christos Koulamas,et al.  Flexible flow shop scheduling with uniform parallel machines , 2006, Eur. J. Oper. Res..

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

[10]  Xin-She Yang,et al.  Review of Metaheuristics and Generalized Evolutionary Walk Algorithm , 2011, 1105.3668.

[11]  Jairo R. Montoya-Torres,et al.  Scheduling jobs on a k-stage flexible flow-shop , 2004, Proceedings of the 2004 IEEE Systems and Information Engineering Design Symposium, 2004..

[12]  George L. Vairaktarakis,et al.  Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..

[13]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

[14]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

[15]  Abdelhakim Artiba,et al.  Scheduling two-stage hybrid flow shop with availability constraints , 2006, Comput. Oper. Res..

[16]  T. C. Edwin Cheng,et al.  Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop , 2003, Eur. J. Oper. Res..

[17]  K. Chandrasekaran,et al.  Multi-objective scheduling problem: Hybrid approach using fuzzy assisted cuckoo search algorithm , 2012, Swarm Evol. Comput..

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

[19]  Funda Sivrikaya-Serifoglu,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach , 2004, J. Oper. Res. Soc..

[20]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[21]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[22]  Shih-Wei Lin,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach , 2006 .

[23]  T. Yang *,et al.  Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study , 2004 .

[24]  Xin-She Yang,et al.  Engineering optimisation by cuckoo search , 2010 .

[25]  Salah E. Elmaghraby,et al.  Sequencing Three-Stage Flexible Flowshops with Identical Machines to Minimize Makespan , 2001 .

[26]  Orhan Engin,et al.  Using ant colony optimization to solve hybrid flow shop scheduling problems , 2007 .

[27]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[28]  Ching-Jong Liao,et al.  An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem , 2012, Appl. Soft Comput..

[29]  Abdelhakim Artiba,et al.  A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan , 1998, Eur. J. Oper. Res..

[30]  Kenneth Morgan,et al.  Modified cuckoo search: A new gradient free optimisation algorithm , 2011 .

[31]  Shaukat A. Brah,et al.  Heuristics for scheduling in a flow shop with multiple processors , 1999, Eur. J. Oper. Res..

[32]  Ali R. Yildiz,et al.  Cuckoo search algorithm for the selection of optimal machining parameters in milling operations , 2012, The International Journal of Advanced Manufacturing Technology.

[33]  Mostafa Zandieh,et al.  An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[34]  Yves Pochet,et al.  A branch-and-bound algorithm for the hybrid flowshop , 2000 .

[35]  Fuh-Der Chou,et al.  A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan , 2011 .

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

[37]  Ebbe G. Negenman,et al.  Local search algorithms for the multiprocessor flow shop scheduling problem , 2001, Eur. J. Oper. Res..

[38]  Ching-Jong Liao,et al.  A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks , 2008 .

[39]  Marie-Claude Portmann,et al.  Branch and bound crossed with GA to solve hybrid flowshops , 1998, Eur. J. Oper. Res..

[40]  Cengiz Kahraman,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach , 2010, Appl. Soft Comput..

[41]  Xin-She Yang,et al.  Multiobjective cuckoo search for design optimization , 2013, Comput. Oper. Res..

[42]  Zhihua Cui,et al.  Swarm Intelligence and Bio-Inspired Computation: Theory and Applications , 2013 .

[43]  Alper Döyen,et al.  A new approach to solve hybrid flow shop scheduling problems by artificial immune system , 2004, Future Gener. Comput. Syst..

[44]  Nirwan Ansari,et al.  A Genetic Algorithm for Multiprocessor Scheduling , 1994, IEEE Trans. Parallel Distributed Syst..

[45]  Kuo-Ching Ying,et al.  Minimising makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm , 2012 .

[46]  Astghik Babayan,et al.  Solving the n-job 3-stage flexible flowshop scheduling problem using an agent-based approach , 2004 .

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

[48]  J. Gupta,et al.  Scheduling a two-stage hybrid flowshop with separable setup and removal times , 1994 .

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

[50]  Ceyda Oguz,et al.  A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks , 2005, J. Sched..

[51]  Orhan Engin,et al.  An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems , 2011, Appl. Soft Comput..

[52]  İsmail Durgun,et al.  Structural Design Optimization of Vehicle Components Using Cuckoo Search Algorithm , 2012 .

[53]  Mostafa Zandieh,et al.  An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines , 2010 .