The resource-constrained project scheduling problem with stochastic activity durations

Abstract

The Resource-Constrained Project Scheduling Problem (RCPSP) has been widely studied. A fundamental assumption of the RCPSP is that the activity durations are known before their execution. In reality, however, this is almost never the case. In this article, we illustrate why it is important to incorporate activity duration variability and develop an exact model to solve the Stochastic Resource-Constrained Scheduling Problem (SRCPSP). The performance of the model is assessed using a computational experiment. The model is intended for small-to medium sized projects where activities have a moderate-to large level of duration variability.