Name
Abstract | ||
|---|---|---|
In this paper, we study a project assignment problem. Specifically, a set of projects, each of which needs to be finished over a project development cycle, are to be assigned to a group of identical engineers over a discrete planning horizon. The workload of the projects is different and fluctuates over their development cycles. In any period, an engineer has a maximum allowed workload. The objective of the problem is to assign the projects to engineers with the objective of balancing the total workload among the engineers; the load balance is measured by the difference between the maximum and the minimum total workload. Such a problem is new to the literature. The problem is strongly NP-hard. Therefore, we propose a two-stage heuristic approach to solve it. Extensive numerical experiments show that the proposed approach can achieve optimal or nearly optimal solutions for all test cases; such performance is much better than what can be obtained from an IP model solved with ILOG CPLEX11. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-10439-8_10 | Australasian Conference on Artificial Intelligence |
Keywords | Field | DocType |
optimal solution,minimum total workload,two-stage heuristic approach,development cycle,total workload,ilog cplex11,project assignment,ip model,balancing workload,project development cycle,project assignment problem,load balance,assignment problem | Heuristic,Mathematical optimization,Time horizon,Load balancing (computing),Workload,Computer science,Assignment problem,Test case,Project management | Conference |
Volume | ISSN | Citations |
5866 | 0302-9743 | 1 |
PageRank | References | Authors |
0.35 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhirong Liang | 1 | 3 | 0.74 |
| Songshan Guo | 2 | 46 | 6.50 |
| Yanzhi Li | 3 | 67 | 11.56 |
| Andrew Lim | 4 | 150 | 13.57 |