Heuristic algorithms for minimizing total completion time in a two-machine flowshop with sequence-independent setup times

In this paper, we address the two-machine flowshop with sequence-independent setup times. Heuristic algorithms are proposed to find a near-optimal solution. We propose a constructive heuristic based on new priority rule, local search procedures and a genetic local search algorithm for the problem under consideration. Computational results show that local search procedures contribute to have a better results.