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, Fransa, 6 - 09 Temmuz 2009, ss.90-95 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/iccie.2009.5223857
  • Basıldığı Şehir: Troyes
  • Basıldığı Ülke: Fransa
  • Sayfa Sayıları: ss.90-95
  • Anahtar Kelimeler: Flowshop, Geneticalgorithm, Local search procedure, Setup times, Total completion time
  • Gazi Üniversitesi Adresli: Hayır

Özet

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.