A Hybrid Harmony Search Algorithm for the no-Wait Flow-shop Scheduling Problems

This paper presents a hybrid harmony search (HHS) algorithm for solving no-wait flow shop scheduling problems with total flowtime criterion. First, an initial harmony memory (HM) is formed by taking advantage of the NEH heuristic. Second, the harmony memory is divided into several small groups and each group executes its evolution process independently. At the same time, groups share information reciprocally by dynamic re-grouping mechanism. Third, to stress the balance between the global exploration and local exploration, a variable neighborhood search algorithm is developed and embedded in the HHS algorithm. In addition, a speed-up method is applied to reduce the running time requirement. Computational simulation results based on the well-known benchmarks and statistical performance comparisons are provided. It is shown that the proposed HHS algorithm is superior to the recently published hybrid DE-based (HDE) algorithm and hybrid particle swarm optimization (HPSO) algorithm in terms of effectiveness and efficiency.

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

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

[3]  Jose M. Framiñan,et al.  Approximative procedures for no-wait job shop scheduling , 2003, Oper. Res. Lett..

[4]  M. Fesanghary,et al.  Optimization of multi-pass face-milling via harmony search algorithm , 2009 .

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

[6]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

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

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

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

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

[11]  C. Rajendran,et al.  Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .

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

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

[14]  Józef Grabowski,et al.  Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..

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

[16]  L. Coelho,et al.  An improved harmony search algorithm for synchronization of discrete-time chaotic systems , 2009 .

[17]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[18]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

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

[20]  Maurice Bonney,et al.  Solutions to the Constrained Flowshop Sequencing Problem , 1976 .

[21]  Jose M. Framiñan,et al.  An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach , 2006, Comput. Oper. Res..

[22]  Quan-Ke Pan,et al.  A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems , 2009, Comput. Oper. Res..

[23]  Zong Woo Geem,et al.  Optimal Scheduling of Multiple Dam System Using Harmony Search Algorithm , 2007, IWANN.

[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]  Chuen-Lung Chen,et al.  Genetic algorithms applied to the continuous flow shop problem , 1996 .

[26]  Jack Heller,et al.  Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .

[27]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[29]  D. Chaudhuri,et al.  Heuristic algorithms for continuous flow-shop problem , 1990 .

[30]  A. S. Spachis,et al.  Heuristics for flow-shop scheduling , 1980 .

[31]  Stefan Voß,et al.  Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..

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

[33]  Zong Woo Geem,et al.  Harmony Search Algorithm for Solving Sudoku , 2007, KES.

[34]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

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

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

[37]  Mehmet Fatih Tasgetiren,et al.  Particle swarm optimization algorithm for single machine total weighted tardiness problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[38]  Ling Wang,et al.  An effective hybrid particle swarm optimization for no-wait flow shop scheduling , 2007 .

[39]  Mehmet Polat Saka,et al.  Optimum design of steel sway frames to BS5950 using harmony search algorithm , 2009 .