2009 International Conference on Computers and Industrial Engineering, CIE 2009, Troyes, France, 6 - 09 July 2009, pp.90-95
In this paper, we address the two-machine flowshop withsequence-independent setup times. Heuristic algorithms are proposed to find anear-optimal solution. We propose a constructive heuristic based on new priorityrule, local search procedures and a genetic local search algorithm for theproblem under consideration. Computational results show that local searchprocedures contribute to have a better results. © 2009 IEEE.