Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem

Monique Guignard and Moshe B. Rosenwein
Additional contact information
Monique Guignard: University of Pennsylvania, Philadelphia, Pennsylvania
Moshe B. Rosenwein: AT&T Bell Laboratories, Holmdel, New Jersey

Operations Research, 1989, vol. 37, issue 4, 658-663

Abstract: The generalized assignment problem (GAP) determines the minimum cost assignment of n jobs to m agents such that each job is assigned to exactly one agent, subject to an agent's capacity. Existing solution algorithms have not solved problems with more than 100 decision variables. This paper designs an optimization algorithm for the GAP that effectively solves problems with up to 500 variables. Compared with existing procedures, this algorithm requires fewer enumeration nodes and shorter running times. Improved performance stems from: an enhanced Lagrangian dual ascent procedure that solves a Lagrangian dual at each enumeration node; adding a surrogate constraint to the Lagrangian relaxed model: and an elaborate branch-and-bound scheme. An empirical investigation of various problem structures, not considered in existing literature, is also presented.

Keywords: programming; integer: an algorithm for the GAP (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.4.658 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:37:y:1989:i:4:p:658-663

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().