Resource-constrained multi-project scheduling: Priority rule performance revisited

被引:180
作者
Browning, Tyson R. [1 ]
Yassine, Ali A. [2 ]
机构
[1] Texas Christian Univ, Neeley Sch Business, Ft Worth, TX 76129 USA
[2] Amer Univ Beirut, Engn Management Program, Beirut, Lebanon
关键词
Project management; Multi-project scheduling; Resource constraints; Priority rules; LIMITED RESOURCES; GENETIC ALGORITHM; DECOMPOSITION APPROACH; HEURISTIC PERFORMANCE; MANAGEMENT SOFTWARE; DATE; ASSIGNMENT; ALLOCATION; SELECTION; SYSTEM;
D O I
10.1016/j.ijpe.2010.03.009
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Managers of multiple projects with overly constrained resources face difficult decisions in how to allocate resources to minimize the average delay per project or the time to complete the whole set of projects. We address the static resource-constrained multi-project scheduling problem (RCMPSP) with two lateness objectives, project lateness and portfolio lateness. In this context, past research has reported conflicting results on the performance of activity priority rule heuristics and does not provide managers with clear guidance on which rule to use in various situations. Using recently improved measures for RCMPSP characteristics, we conducted a comprehensive analysis of 20 priority rules on 12,320 test problems generated to the specifications of project-, activity-, and resource-related characteristics including network complexity and resource distribution and contention. We found several situations in which widely advocated priority rules perform poorly. We also confirmed that portfolio managers and project managers will prefer different priority rules depending on their local or global objectives. We summarize our results in two decision tables, the practical use of which requires managers to do only a rough, qualitative characterization of their projects in terms of complexity, degree of resource contention, and resource distribution. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:212 / 228
页数:17
相关论文
共 64 条