Abstract
The characteristics of the multi-project task scheduling under multi-resource constraints are analyzed and the mathematical model based on the shortest delay time for this problem is constructed. Based on the new time-sequence relation graph composed of the time-sequence relations between the tasks scheduling on resource and the time-sequence relations inside the projects, this paper presents a common algorithm for this problem. In order to decrease the amount and complexity of calculation and fit the practice, a heuristic algorithm combined the common algorithm and the rules, and this algorithm steps are presented. A calculation demonstration shows that the heuristic algorithm can solve the problem of the multi-project task scheduling under multi-resource constraints effectively.
| Original language | English |
|---|---|
| Pages (from-to) | 1045-1049 |
| Number of pages | 5 |
| Journal | Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology |
| Volume | 39 |
| Issue number | 7 |
| State | Published - Jul 2007 |
Keywords
- Heuristic algorithm
- Multi-resource constrained
- Task scheduling
Fingerprint
Dive into the research topics of 'Research on the multi-project task scheduling under multi-resource constraints'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver