Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems

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

COMPUTERS & OPERATIONS RESEARCH, cilt.36, sa.9, ss.2531-2540, 2009 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 36 Sayı: 9
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1016/j.cor.2008.10.006
  • Dergi Adı: COMPUTERS & OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.2531-2540
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

This study considers an operation assignment and capacity allocation problem that arises in flexible manufacturing systems. Automated machines are assumed to have scarce time and tool magazine capacities and the tools are available in limited quantities. The aim is to select a subset of operations with maximum total weight. The weight of an operation may represent its profit, processing load, relative priority. Several upper bounding procedures have been taken into account. The results of computational tests have revealed that the proposed upper bounding procedures produce satisfactory solutions in reasonable CPU times. We suggest using some of the bounds when the quality of the solutions is more important than the speed of achieving them and some others when the speed is more important than the quality. (C) 2008 Elsevier Ltd. All rights reserved.