Bicriteria multiresource generalized assignment problem
Date
2014
Authors
Karsu, O.
Azizoglu, M.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Naval Research Logistics
Print ISSN
0894-069X
Electronic ISSN
1520-6750
Publisher
John Wiley & Sons
Volume
61
Issue
8
Pages
621 - 636
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
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.
Course
Other identifiers
Book Title
Keywords
Branch and bound , Generalized assignment problem , Heuristics , Linear programming relaxation , Branch and bound method , Combinatorial optimization , Linear programming , Bi-criteria , Computational results , Generalized assignment problem , Heuristics , Linear programming relaxation , Lower and upper bounds , Multi-resource generalized assignment problem , Heuristic algorithms