Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches

ÖZPEYNİRCİ S., AZİZOĞLU M.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.47, sa.21, ss.5941-5958, 2009 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 47 Sayı: 21
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1080/00207540802154845
  • Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.5941-5958
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

This study considers an operation assignment and capacity allocation problem that arises in flexible manufacturing systems. The machines have limited time and tool magazine capacities and the available tools are limited. Our objective is to maximise total weight of assigned operations. We develop a branch and bound algorithm that finds the optimal solutions and a beam search algorithm that finds high quality solutions in polynomial time.