A Survey of the Generalized Assignment Problem and Its Applications.
Saved in:
| Title: | A Survey of the Generalized Assignment Problem and Its Applications. |
|---|---|
| Authors: | Öncan, Temel |
| Source: | INFOR; Aug2007, Vol. 45 Issue 3, p123-141, 19p |
| Subject Terms: | INDUSTRIAL engineering, COMBINATORIAL optimization, KNAPSACK problems, PRODUCTION scheduling, HEURISTIC, CAPACITY requirements planning |
| Abstract: | Given n items and m knapsacks, the Generalized Assignment Problem (GAP) is to find the optimum assignment of each item to exactly one knapsack, without exceeding the capacity of any knapsack. This problem can also be described as the optimal assignment of n jobs to m capacitated agents. During the last three decades, many papers have been published on the GAP. In this survey we mainly concentrate on its real life applications in scheduling, timetabling, telecommunication, facility location, transportation, production planning, etc. We also mention some of the most recent solution approaches: from state of the art metaheuristics to variable neighborhood search algorithms and from exact solution procedures to simple heuristic algorithms. [ABSTRACT FROM AUTHOR] |
| Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!