A composite heuristic for the no-wait flow shop scheduling

Heuristics that explore specific characteristics of the problem are essential to find good solutions in limited computational time for many practical systems. This paper first presents a constructive heuristic, namely improved standard deviation heuristic (ISDH), by combining the standard deviation heuristic (SDH) with the procedure of effective double-job-insert-operator. Then, a composite heuristic, improved standard deviation heuristic with iteration (ISDHI), is proposed using the iteration operator to improve the solutions of the ISDH. Extensive computational experiments are carried out based on a set of well-known flow shop benchmark instances that are considered as no-wait flow shop scheduling instances. Computational results and comparisons show that the ISDHI performs significantly better than the existing ones, and the ISDHI heuristic further improves the proposed constructive heuristics for no-wait flow shop scheduling problem with total flow time criterion.

[1]  Tariq A. Aldowaisan,et al.  No-wait and separate setup three-machine flowshop with total completion time criterion , 2000 .

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

[3]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .

[4]  Ali Allahverdi,et al.  New heuristics to minimize total completion time in m-machine flowshops , 2002 .

[5]  Jose M. Framiñan,et al.  Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .

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

[7]  Q. Wang,et al.  Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .

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

[9]  Ali Allahverdi,et al.  Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times , 2001, J. Oper. Res. Soc..

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

[11]  Subhash C. Sarin,et al.  A heuristic to minimize total flow time in permutation flow shop , 2009 .

[12]  Edy Bertolissi,et al.  Heuristic algorithm for scheduling in the no-wait flow-shop , 2000 .

[13]  Han Hoogeveen,et al.  Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing , 2000, Eur. J. Oper. Res..

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

[15]  J. Kamburowski,et al.  On the NEH heuristic for minimizing the makespan in permutation flow shops , 2007 .

[16]  Ali Allahverdi,et al.  Total flowtime in no-wait flowshops with separated setup times , 1998, Comput. Oper. Res..

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

[18]  Chuen-Lung Chen,et al.  Genetic algorithms applied to the continuous flow shop problem , 1996 .

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

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

[21]  Tariq A. Aldowaisan A new heuristic and dominance relations for no-wait flowshops with setups , 2001, Comput. Oper. Res..

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

[23]  A. Allahverdi,et al.  New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness , 2009 .

[24]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

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