Stability and resource allocation in project planning

Abstract

The majority of resource-constrained project scheduling efforts assume perfect information about the scheduling problem to be solved and a static deterministic environment within which the precomputed baseline schedule is executed. In reality, project activities are subject to considerable uncertainty, which generally leads to numerous schedule disruptions. In this paper, we present a resource allocation model that protects a given baseline schedule against activity duration variability. A branch-and-bound algorithm is developed that solves the proposed resource allocation problem. We report on computational results obtained on a set of benchmark problems.

Notes

*6.5% of the problems ran out of storage space for the MFSs for n = 61, is considered as ‘not solved to optimality,’

**is not taken into account on computing the average values for the corresponding table entries marked by ‘**’.