Improvement Tools for NEH Based Heuristics on Permutation and Blocking Flow Shop Scheduling Problems

In this paper, two tools to improve the performance of the NEH-based heuristics for the flow shop problem with and without buffer constraints are proposed. The first tool is the use of the reversibility property of the problems considered and the second one is a new tie-breaking strategy to be use in the insertion phase of the NEH heuristic. In addition, we have analyzed the behavior of five initial solution procedures for both problems. The analysis of results confirms the effectiveness of the measures proposed and allows us to recommend the best ordering procedure for each one of the problems.

[1]  Marcelo Seido Nagano,et al.  A high quality solution constructive heuristic for flow shop sequencing , 2002, J. Oper. Res. Soc..

[2]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

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

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

[5]  Hamid Davoud Pour.  A new heuristic for the n-job, m-machine flow-shop problem , 2001 .

[6]  Jerzy Kamburowski,et al.  An improved NEH heuristic to minimize makespan in permutation flow shops , 2008, Comput. Oper. Res..

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

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

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

[10]  C. V. Ramamoorthy,et al.  On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .

[11]  Christos H. Papadimitriou,et al.  Flowshop scheduling with limited temporary storage , 1980, JACM.

[12]  Manuel Mateo,et al.  Different behaviour of a double branch-and-bound algorithm on Fm|prmu|Cmax and Fm|block|Cmax problems , 2007, Comput. Oper. Res..

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

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