On the NEH heuristic for minimizing the makespan in permutation flow shops

Over the last 20 years the NEH heuristic of Nawaz, Enscore, and Ham published in this journal has been commonly regarded as the best heuristic for minimizing the makespan in permutation flow shops. In recent years some authors claimed to develop new heuristics that are competitive or outperform NEH....

Full description

Saved in:
Bibliographic Details
Published in:Omega (Oxford) 2007-02, Vol.35 (1), p.53-60
Main Authors: Kalczynski, Pawel Jan, Kamburowski, Jerzy
Format: Article
Language:English
Subjects:
Analysis
Applied sciences
Exact sciences and technology
Flow-shop
Heuristic
Heuristic programming
Heuristics
Job shops
Machine shops
Operational research and scientific management
Operational research. Management science
Scheduling
Scheduling (Management)
Scheduling algorithms
Scheduling, sequencing
Sequencing
Sequencing Flow-shop Heuristics Scheduling
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Over the last 20 years the NEH heuristic of Nawaz, Enscore, and Ham published in this journal has been commonly regarded as the best heuristic for minimizing the makespan in permutation flow shops. In recent years some authors claimed to develop new heuristics that are competitive or outperform NEH. Our study reveals that these claims are not justified. We also address the issue of a fair comparison of the NEH results with those obtained by metaheuristics. Finally we conduct a thorough analysis of NEH leading to its modification which secures the optimality in the two-machine case and improves the general performance.
ISSN:0305-0483
1873-5274
DOI:10.1016/j.omega.2005.03.003