DTEW Research Report 0256
Author:
Keywords:
Constraint satisfaction, Information, Model, Planning, Problems, Project management, Project planning, Project scheduling, Resource allocati, Scheduling, Stability, Uncertainty, Variability
Abstract:
The majority of resource-constrained project scheduling efforts assumes perfect information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed 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.