On Recent Modifications And Extensions Of The Neh Heuristic For Flow Shop Sequencing

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

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

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

[4]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[5]  Chinyao Low,et al.  A robust simulated annealing heuristic for flow shop scheduling problems , 2004 .

[6]  Jerzy Kamburowski,et al.  An empirical analysis of the optimality rate of flow shop heuristics , 2009, Eur. J. Oper. Res..

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

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

[9]  Ping Chen,et al.  An improved NEH-based heuristic for the permutation flowshop problem , 2008, Comput. Oper. Res..

[10]  Rubén Ruiz,et al.  New high performing heuristics for minimizing makespan in permutation flowshops , 2009 .

[11]  Yuanyuan Liu,et al.  Some supplementation for NEH heuristic in solving flow shop problem , 2007, 2007 American Control Conference.

[12]  Uday Kumar Chakraborty,et al.  An improved heuristic for permutation flowshop scheduling , 2007, Int. J. Inf. Commun. Technol..

[13]  张卫东,et al.  Break the Ties for NEH Heuristic in Solving the Permutation Flow Shop Problems , 2008 .

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

[15]  Lin-Yu Tseng,et al.  A hybrid genetic local search algorithm for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..

[16]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

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

[18]  Joel P. Stinson,et al.  A heuristic proǵramminǵ procedure for sequencinǵ the static flowshop , 1982 .

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

[20]  Christos D. Tarantilis,et al.  Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm , 2009, Comput. Oper. Res..

[21]  Chen Lin,et al.  Enhanced NEH method in solving permutation flow shop problem , 2007 .

[22]  Wang Yue-xuan,et al.  Heuristic algorithms for large flowshop scheduling problems , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).