A flexible flowshop problem with total flow time minimization

Azizoglu M., Cakmak E., Kondakci S.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.132, sa.3, ss.528-538, 2001 (SCI-Expanded) identifier identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 132 Sayı: 3
  • Basım Tarihi: 2001
  • Doi Numarası: 10.1016/s0377-2217(00)00142-9
  • Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.528-538
  • Anahtar Kelimeler: flexible flowshop, parallel machines, total flow time, SHOP
  • Anadolu Üniversitesi Adresli: Hayır

Özet

In this study, we consider total flow time problem in a flexible flowshop environment. We develop a branch and bound algorithm to find the optimal schedule. The efficiency of the algorithm is enhanced by upper and lower bounds and a dominance criterion. Computational experience reveals that the algorithm solves moderate sized problems in reasonable solution times. (C) 2001 Elsevier Science B.V. All rights reserved.