An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem
We propose an improved IG algorithm for the no-wait flowshop scheduling problem. The proposed algorithm is incorporated with a Tabu-based reconstruction strategy. Simulation results confirm the advantages of utilizing the new reconstruction scheme. Our algorithm is more effective than other competitive algorithms in the literature. 43 new upper bound solutions for the problem have been made available.
iterated greedy algorithm no-wait flow shop tabu search makespan