A Hybrid Discrete Harmony Search Algorithm for blocking flow shop Scheduling

This paper presents a hybrid discrete harmony search (DUS) algorithm for solving the blocking flow shop scheduling problem with the objective to minimize makespan. The proposed hybrid DUS algorithm utilizes discrete job permutations to represent harmonies and applies a job-permutation-based improvisation scheme to generate new harmonies. An initialization scheme based on a variant of the Minimum Blocking Tardiness (MBT) heuristic is presented to construct the initial harmony memory with a certain level of quality and diversity. The DUS algorithm is employed to evolve harmony vectors in the harmony memory to perform exploration, whereas a local search algorithm based on the insert neighborhood is embedded to enhance the local exploitation ability. Computational simulations and comparisons demonstrate that the proposed algorithm (DUS) is effective and efficient for the blocking flow shop scheduling problems with makes pan criterion.

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

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

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

[4]  Pang Ha-li.  Study on minimum blocked time algorithm for blocking flow-shop scheduling , 2007 .

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

[6]  R. Storn,et al.  Differential evolution a simple and efficient adaptive scheme for global optimization over continu , 1997 .

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

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

[9]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

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

[11]  Z. Geem.  Optimal Design of Water Distribution Networks Using Harmony Search , 2009 .

[12]  Débora P. Ronconi,et al.  A note on constructive heuristics for the flowshop problem with blocking , 2004 .

[13]  Rainer Leisten,et al.  Flowshop sequencing problems with limited buffer storage , 1990 .

[14]  Débora P. Ronconi,et al.  Some heuristic algorithms for total tardiness minimization in a flowshop with blocking , 2009 .

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

[16]  K. Lee,et al.  The harmony search heuristic algorithm for discrete structural optimization , 2005 .

[17]  Z. Geem.  Optimal cost design of water distribution networks using harmony search , 2006 .

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

[19]  Tapan P. Bagchi,et al.  Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .

[20]  Richard S. H. Mah,et al.  An implicit enumeration scheme for the flowshop problem with no intermediate storage , 1981 .

[21]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

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