Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms

In this paper, three hybrid harmony search (HS) algorithms, namely, hybrid harmony search (hHS) algorithm, hybrid globalbest harmony search (hgHS) algorithm and hybrid modified globalbest harmony search (hmgHS) algorithm, are developed for solving the flow shop scheduling with blocking to minimize the total flow time. Firstly, a largest position value (LPV) rule is proposed to convert continuous harmony vectors into job permutations. Secondly, an initialization scheme based on a variant of the NEH heuristic is presented to construct the initial harmony memory with certain quality and diversity. Thirdly, HS 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. In addition, some new pitch adjustment rules are developed to well inherit good structures from the globalbest harmony vector. Based on a set of well-known benchmark instances, extensive computational experiments are carried out. Computational results show the effectiveness of the hybrid harmony search algorithms, especially the (hmgHS) algorithm, in solving the blocking flow shop scheduling with total flow time criterion.

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

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

[3]  M. Fesanghary,et al.  An improved harmony search algorithm for solving optimization problems , 2007, Appl. Math. Comput..

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

[5]  Zong Woo Geem,et al.  Application of Harmony Search to Vehicle Routing , 2005 .

[6]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

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

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

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

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

[11]  Zong Woo Geem,et al.  Novel derivative of harmony search algorithm for discrete design variables , 2008, Appl. Math. Comput..

[12]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

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

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

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

[16]  C. Rajendran,et al.  Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem , 2003 .

[17]  Mahamed G. H. Omran,et al.  Global-best harmony search , 2008, Appl. Math. Comput..

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

[19]  K. Lee,et al.  A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .

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

[21]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers , 2009 .

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

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

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