A scatter search algorithm for the distributed permutation flowshop scheduling problem
We present a scatter search method for the distributed permutation flowshop problem. We employ some advanced techniques like a mixed reference set. We use other features like restarts and local search. Experiments show that the proposed algorithm is state-of-the-art. All 720 known best solutions for this problem are improved.
scatter search permutation flowshop distributed scheduling