Bicriteria multiresource generalized assignment problem |
| |
Authors: | Özlem Karsu Meral Azizoğlu |
| |
Affiliation: | 1. Department of Industrial Engineering, Bilkent University, , Ankara, 06800 Turkey;2. Department of Industrial Engineering, Middle East Technical University, , Ankara, 06531 Turkey |
| |
Abstract: | 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. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621–636, 2014 |
| |
Keywords: | generalized assignment problem linear programming relaxation branch and bound heuristics |
|
|