Flow shop-sequencing problem with synchronous transfers and makespan minimization

Soylu B., Kirca O., Azizoglu M.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.45, sa.15, ss.3311-3331, 2007 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 45 Sayı: 15
  • Basım Tarihi: 2007
  • Doi Numarası: 10.1080/00207540600621672
  • Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.3311-3331
  • Anahtar Kelimeler: flow shops, scheduling, makespan, branch-and-bound, IN-PROCESS, HEURISTICS, MACHINE
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

This study considers a permutation flow shop-sequencing problem with synchronous transfers between stations. The objective is to minimize the makespan. It is shown that the problem is strongly NP-hard. A branch-and-bound algorithm together with several lower and upper bounding procedures are developed. The algorithm returns optimal solutions to moderate-sized problem instances in reasonable solution times.