Until recently, the NEH heuristic of Nawaz, Enscore and Ham published in j 1983 was commonly regarded as the best constructive heuristic for solving the classic j strongly NP-hard problem of minimizing the makespan in permutation flow shops. The I long-lasting success of NEH inspired many researchers to propose improvements to the original heuristic. In this paper, we empirically examine recent modifications and extensions of NEH and present a heuristic for the permutation flow shop problem which incorporates components from the best proposals. The performance of analyzed heuristics is evaluated with respect to the improvement over NEH and additional computational time required to achieve this improvement.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.