Flow shop-sequencing problem with synchronous transfers and makespan minimization


Soylu B., Kirca O., Azizoglu M.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.45, ss.3311-3331, 2007 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 45 Konu: 15
  • Basım Tarihi: 2007
  • Doi Numarası: 10.1080/00207540600621672
  • Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Sayfa Sayıları: ss.3311-3331

Ö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.