关键词: 柔性工期, 项目工期-成本权衡, 项目完工时间压缩

Abstract: In this paper we study a resource constrained project scheduling problem in which the duration of an activity is unknown and should be determined according to the project deadline and resource availability. In the classical resource-constrained project scheduling problem (RCPSP), the duration of an activity is often known and fixed, which limits the flexibility of project scheduling to some extent. Although the multi-mode resource-constrained project scheduling problem (MRCPSP) makes up for this shortcoming, the duration-resource combinations provided are fixed and limited, which may not guarantee the inclusion of the optimal one. Therefore, in this paper, neither the resource purchases nor the duration of each activity is a known priori and needs to be determined flexibly. A bi-objective time-cost trade-off model is established and a two-stage nested algorithm (NSGAⅡ-RS) is designed. The experiment shows that this scheduling method can effectively compress project makespan and it is a robust strategy.

Key words: variable duration, time-cost trade-off, compressing project makespan