Two-machine, no-wait flowshop scheduling problem to minimize maximum lateness with separate set-up and removal times

Fondrevelle J., Allahverdi A., Oulamara A.

International Journal of Agile Manufacturing, cilt.8, sa.2, ss.165-174, 2005 (Scopus) identifier

  • Yayın Türü: Makale / Özet
  • Cilt numarası: 8 Sayı: 2
  • Basım Tarihi: 2005
  • Dergi Adı: International Journal of Agile Manufacturing
  • Derginin Tarandığı İndeksler: Scopus
  • Sayfa Sayıları: ss.165-174
  • Anahtar Kelimeler: Branch-and-Bound, Maximum Lateness, No-wait Flowshop, Set-up and Removal Times
  • Gazi Üniversitesi Adresli: Hayır

Özet

We address the two-machine, no-wait flowshop scheduling problem to minimize maximum lateness wherein set-up and removal times are treated as separate from processing time. We obtain optimal solutions for special cases. Moreover, we propose a branch-and-bound algorithm for the generic case. We conduct extensive experimentations to evaluate the performance of the proposed branch-and-bound algorithm. The computational analysis shows that the branch-and-bound algorithm is quite efficient, especially when set-up and removal times are not too large, compared to processing times. Dileepan [1] presented a dominance property for the same problem without removal times. In this paper, we also evaluate the performance of Dileepan's dominance property and show that it performs exceedingly well. © 2005 IJAM.