A survey of algorithms for the generalized assignment problem

A survey of algorithms for the generalized assignment problem

0.00 Avg rating0 Votes
Article ID: iaor1996609
Country: Netherlands
Volume: 60
Issue: 3
Start Page Number: 260
End Page Number: 272
Publication Date: Aug 1992
Journal: European Journal of Operational Research
Authors: ,
Abstract:

This paper surveys algorithms for the well-known problem of finding the minimum cost assignment of jobs to agents so that each job is assigned exactly once and agents are not overloaded. All approaches seem to be based on branch-and-bound with bounds supplied through heuristics and through relaxations of the primal problem formulation. From the survey one can select building blocks for the design of one’s own tailor-made algorithm. The survey also reveals that although just about every mathematical programming technique was tried on this problem, there is still a lack of a representative set of test problems on which competing enumeration algorithms can be compared, as well as a shortage of effective heuristics.

Reviews

Required fields are marked *. Your email address will not be published.