A hybrid metaheuristic for the minimization of the makespan in permutation flow shop scheduling problem (FSSP) is proposed
which combines Particle Swarm Optimization (PSO) and Iterative Greedy (IG)
and takes advantage of Destruction and Construction (DC) of IG to prevent the swarm from premature convergence.Individual hovering is defined to control when the particle mutate.Besides
an insert (shift) neighborhood search is introduced to improve the particle's searching ability.Finally
we present an efficient population re-initialization scheme to avoid premature convergence further.The proposed algorithm is tested on different scale benchmarks and compared with the other representative algorithms.The result shows that HDCPSO is better than other algorithms in not only the solution quality but also the stability.