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

Msakni M. K., Ladhari T., Allahverdi A.

2009 International Conference on Computers and Industrial Engineering, CIE 2009, Troyes, France, 6 - 09 July 2009, pp.90-95 identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1109/iccie.2009.5223857
  • City: Troyes
  • Country: France
  • Page Numbers: pp.90-95
  • Keywords: Flowshop, Geneticalgorithm, Local search procedure, Setup times, Total completion time
  • Gazi University Affiliated: No

Abstract

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.