Article ID: | iaor1995730 |
Country: | Switzerland |
Volume: | 50 |
Issue: | 1 |
Start Page Number: | 487 |
End Page Number: | 503 |
Publication Date: | Sep 1994 |
Journal: | Annals of Operations Research |
Authors: | Racer Michael, Amini Mohammad M. |
Keywords: | heuristics |
The Generalized Assignment Problem, in the class of NP-hard problems, occurs in a wide range of applications-vehicle packing, computers, and logistics, to name only a few. Previous research has been concentrated on optimization methodologies for the GAP. Because the Generalized Assignment Problem is NP-hard, optimization methods tend to require larger computation times for large-scale problems. This paper presents a new heuristic,