Name
Abstract | ||
|---|---|---|
Resource conflict is an outstanding problem in concurrent multiple projects with sharing a common and limited resource pool, and it often results in lower performance of these projects. Therefore, it is important and urgent to find an effective method for scheduling multiple projects with limited resources. A mathematical model for the multi-project scheduling problem with resource-constrained is proposed, and a scheduling algorithm based on greedy strategy for the problem is analyzed. Its application in real projects and comparison with other scheduling schemes proves that the algorithm is feasible. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ICAS.2009.9 | ICAS |
Keywords | Field | DocType |
greedy strategy,multiple project,limited resource pool,concurrent multiple project,scheduling scheme,scheduling algorithm,effective method,limited resource,multi-project scheduling problem,resource conflict,outstanding problem,sampling methods,job shop scheduling,genetic algorithms,project management,project scheduling,data mining,resource management,resource allocation,scheduling,mathematical model,aerospace engineering,algorithm design and analysis,greedy algorithms | Mathematical optimization,Job shop scheduling,Fair-share scheduling,Computer science,Two-level scheduling,Greedy algorithm,Genetic algorithm scheduling,Resource allocation,Rate-monotonic scheduling,Dynamic priority scheduling,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haibin Liu | 1 | 0 | 0.34 |
| Yanbing Wang | 2 | 5 | 4.33 |