An improved NEH heuristic to minimize makespan in permutation flow shops

Authors:
Pawel J. Kalczynski;Jerzy Kamburowski
Affiliations:
Department of Information Operations and Technology Management, College of Business Administration, The University of Toledo, Mail Stop # 103, Toledo, OH 43606-3390, USA;Department of Information Operations and Technology Management, College of Business Administration, The University of Toledo, Mail Stop # 103, Toledo, OH 43606-3390, USA
Venue:
Computers and Operations Research
Year:
2008

Citing 13
Cited 7

New results in the worst-case analysis for flow-shop scheduling

Discrete Applied Mathematics
Improved Approximation Algorithms for Shop Scheduling Problems

SIAM Journal on Computing
A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Vector summation in Banach space and polynomial algorithms for flow shops and open shops

Mathematics of Operations Research
Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance

INFORMS Journal on Computing
New heuristics for no-wait flowshops to minimize makespan

Computers and Operations Research
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion

Computers and Operations Research
A neuro-tabu search heuristic for the flow shop scheduling problem

Computers and Operations Research
Some local search algorithms for no-wait flow-shop problem with makespan criterion

Computers and Operations Research
A computational study of the permutation flow shop problem based on a tight lower bound

Computers and Operations Research
A heuristic for minimizing the makespan in no-idle permutation flow shops

Computers and Industrial Engineering
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Permutation vs. non-permutation flow shop schedules

Operations Research Letters

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

Computers and Operations Research
Comparing three-step heuristics for the permutation flow shop problem

Computers and Operations Research
A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion

Computers and Operations Research
A new ant colony algorithm for makespan minimization in permutation flow shops

Computers and Industrial Engineering
A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem

Applied Soft Computing
Makespan minimization flowshop with position dependent job processing times-computational complexity and solution algorithms

Computers and Operations Research
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

For over 20 years the NEH heuristic of Nawaz, Enscore, and Ham [A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, The International Journal of Management Science 1983;11:91-5] has been commonly regarded as the best heuristic for solving the NP-hard problem of minimizing the makespan in permutation flow shops. The strength of NEH lies mainly in its priority order according to which jobs are selected to be scheduled during the insertion phase. Framinan et al. [Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idle time or flowtime in the static permutation flowshop problem. International Journal of Production Research 2003;41:121-48] presented the results of an extensive study to conclude that the NEH priority order is superior to 136 different orders examined. Based upon the concept of Johnson's algorithm, we propose a new priority order combined with a simple tie-breaking method that leads to a heuristic that outperforms NEH for all problem sizes.