Bicriteria Multiresource Generalized Assignment Problem

Creative Commons License

Karsu O., AZİZOĞLU M.

NAVAL RESEARCH LOGISTICS, cilt.61, sa.8, ss.621-636, 2014 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 61 Sayı: 8
  • Basım Tarihi: 2014
  • Doi Numarası: 10.1002/nav.21607
  • Dergi Adı: NAVAL RESEARCH LOGISTICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.621-636
  • Anahtar Kelimeler: generalized assignment problem, linear programming relaxation, branch and bound, heuristics, EFFICIENT SOLUTIONS, ALGORITHMS, COMPUTER, LOCATION
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. (c) 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621-636, 2014