On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming

Citation

Vazquez-Rodriguez JA & Ochoa G (2011) On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming. Journal of the Operational Research Society, 62 (2), pp. 381-396. https://doi.org/10.1057/jors.2010.132

Abstract
We use genetic programming to find variants of the well-known Nawaz, En-score and Ham (NEH) heuristic for the permutation flow shop problem. Each variant uses a different ranking function to prioritize operations during schedule construction. We have tested our ideas on problems where jobs have release times, due dates, and weights and have considered five objective functions: makespan, sum of tardiness, sum of weighted tardiness, sum of completion times and sum of weighted completion times. The implemented genetic programming system has been carefully tuned and used to generate one variant of NEH for each objective function. The new NEHs, obtained with genetic programming, have been compared with the original NEH and randomized NEH versions on a large set of benchmark problems. Our results indicate that the NEH variants discovered by genetic programming are superior to the original NEH and its stochastic version on most of the problems investigated.

Keywords
heuristics; production; genetic programming; genetic algorithms; hyper-heuristics

Journal
Journal of the Operational Research Society: Volume 62, Issue 2