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

Pawel Jan Kalczynski and Jerzy Kamburowski

Omega, 2007, vol. 35, issue 1, 53-60

Abstract: 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.

Keywords: Sequencing; Flow-shop; Heuristics; Scheduling (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305-0483(05)00060-5
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:35:y:2007:i:1:p:53-60

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().