Name
Abstract | ||
|---|---|---|
We present a simple model for the resource-task assignment process with rejections and reassignments, where the assignment rejection probabilities are considered explicitly. Particularly, we assume that each resource can serve at most one task, and provide several approaches for solving the problem. For many application fields, the assignment rejection probabilities can be obtained from the historical data, the model and solution approaches provided in this paper may help to make better assignment decisions. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/COASE.2007.4341668 | 2007 IEEE International Conference on Automation Science and Engineering |
Keywords | Field | DocType |
Assignment Process,Rejections and Reassignments,Approximate Solution Approaches | Weapon target assignment problem,Set theory,Mathematical optimization,Computer science,Generalized assignment problem,Linear bottleneck assignment problem | Conference |
ISSN | ISBN | Citations |
2161-8070 | 978-1-4244-1153-5 | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liang Pi | 1 | 24 | 2.26 |
| Leyuan Shi | 2 | 361 | 51.32 |