A new Nawaz–Enscore–Ham-based heuristic for permutation flow-shop problem with bicriteria of makespan and machine idle-time

Weibo Liu, Yan Jin, Mark Price

Research output: Contribution to journalArticle

11 Citations (Scopus)
786 Downloads (Pure)


A new heuristic based on Nawaz–Enscore–Ham (NEH) algorithm is proposed for solving permutation flowshop scheduling problem in this paper. A new priority rule is proposed by accounting for the average, mean absolute deviation, skewness and kurtosis, in order to fully describe the distribution style of processing times. A new tie-breaking rule is also introduced for achieving effective job insertion for the objective of minimizing both makespan and machine idle-time. Statistical tests illustrate better solution quality of the proposed algorithm, comparing to existing benchmark heuristics.
Original languageEnglish
Pages (from-to)1808-1822
Number of pages15
JournalEngineering Optimization
Issue number10
Early online date18 Feb 2016
Publication statusPublished - 2016



  • heuristic
  • flow shop
  • makespan
  • idle-time

Cite this