A Hybrid Harmony Search algorithm to minimize total weighted tardiness in the permutation flow shop

We address the permutation flow shop scheduling problem with sequence dependent setup times between jobs. Each job has its weight of importance as well as due date. The goal is to find sequence of jobs such that total weighted tardiness of jobs is minimized. Due to NP-Hard complexity of this problem, a hybrid meta-heuristic algorithm based on Harmony Search Algorithm is developed. In the proposed algorithm, a new acceptance criterion of new improvised harmony is suggested which allows the algorithm to explore the solution space in earlier iterations (diversification), and as algorithm progresses the acceptance criterion leads the algorithm to accept the solutions in neighborhood of the current solution, (intensification). In order to improve the search ability of the algorithm, Variable Neighborhood Search Algorithm is applied to improve the quality of generated harmony. The computational experiments based on well-known benchmark instances are conducted. Results show that the proposed algorithm outperforms other state of the art algorithm used for solving studied problem.

[1]  Chandrasekharan Rajendran,et al.  Scheduling in flowshops to minimize total tardiness of jobs , 2004 .

[2]  C. Rajendran,et al.  Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline-based manufacturing cell , 1998 .

[3]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[4]  Jason Chao-Hsien Pan,et al.  Two-machine flowshop scheduling to minimize total tardiness , 1997, Int. J. Syst. Sci..

[5]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .

[6]  C. Rajendran,et al.  A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs-a case study , 1997 .

[7]  Shaya Sheikh,et al.  Rule Based Layout Planning and Its Multiple Objectives , 2014 .

[8]  Mohamed Haouari,et al.  MIP models for minimizing total tardiness in a two-machine flow shop , 2013, J. Oper. Res. Soc..

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

[10]  Godfrey C. Onwubolu,et al.  Genetic algorithm for minimizing tardiness in flow-shop scheduling , 1999 .

[11]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[12]  Mehmet Fatih Tasgetiren,et al.  A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem , 2011, Comput. Ind. Eng..

[13]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

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

[15]  Rubén Ruiz,et al.  Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics , 2008, Comput. Oper. Res..

[16]  L. Gelders,et al.  Four simple heuristics for scheduling a flow-shop , 1978 .

[17]  Narayan Raman,et al.  Minimum tardiness scheduling in flow shops: Construction and evaluation of alternative solution approaches , 1995 .

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

[19]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[20]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..

[21]  Liang Gao,et al.  A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers , 2011, Appl. Soft Comput..

[22]  Mehmet Fatih Tasgetiren,et al.  Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem , 2004, ANTS Workshop.

[23]  Xiaoping Li,et al.  Adaptive Hybrid Algorithms for the Sequence-Dependent Setup Time Permutation Flow Shop Scheduling Problem , 2012, IEEE Transactions on Automation Science and Engineering.

[24]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[25]  Yeong-Dae Kim.  Minimizing total tardiness in permutation flowshops , 1995 .

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

[27]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs , 1997 .

[28]  Jeffrey E. Schaller,et al.  Note on minimizing total tardiness in a two-machine flowshop , 2005, Comput. Oper. Res..

[29]  Rainer Leisten,et al.  Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm , 2008 .

[30]  Jen-Shiang Chen,et al.  Minimizing tardiness in a two-machine flow-shop , 2002, Comput. Oper. Res..

[31]  Adil Baykasoğlu,et al.  A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates , 1998 .

[32]  Débora P. Ronconi,et al.  Tabu search for total tardiness minimization in flowshop scheduling problems , 1999, Comput. Oper. Res..

[33]  John M. Wilson,et al.  Elite guided steady-state genetic algorithm for minimizing total tardiness in flowshops , 2010, Comput. Ind. Eng..

[34]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[35]  Jatinder N. D. Gupta,et al.  The two-machine flowshop scheduling problem with total tardiness , 1989, Comput. Oper. Res..

[36]  Jiyin Liu,et al.  Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..

[37]  Ömer Kirca,et al.  A branch and bound algorithm to minimize the total tardiness for m , 2006, Eur. J. Oper. Res..

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

[39]  Chandrasekharan Rajendran,et al.  Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times , 2003, Eur. J. Oper. Res..