Study on the Neighborhood of NEH Heuristic

Considering both the time cost and the final solution quality,the application of NEH heuristic with Makespan criteria in solving the permutation flow shop problems is studied.Because one of the strengths of NEH is its iterative neighborhood search policy,using the method of amplifying or simplifying neighborhod,several different space structures are given.The experiment results show that both of the two proposed structures can achieve better solution than ever,i.e.the whole working time can be highly shorten by means of the two algorithms,and move effective scheduling can be gained.