Application Of Iterated Local Search Algorithm To The Hybrid Flow Shop Problem

Multistage processing priority was developed for the hybrid flow shop problem and an iterated local search algorithm was used for solving this kind of problem. In order to testify the effectiveness of the proposed algorithm, a simulation was done based on the extensions of the benchmarks of flow shop problem. Computational result shows that the performance of the proposed algorithm is better than that of the NEH heuristic algorithm and the proposed scheduling strategy is better than the scheduling strategy of fixed priority combining with first-come-first-serve.