Temporal analysis of projects under interval uncertainty

Abstract

Given an activity-on-node network where every activity has an uncertain duration represented by an interval, this chapter takes an interest in computing the minimum and maximum earliest start times, latest start times and floats of all activities over all duration scenarios. The basic results from the literature are recalled and efficient solving algorithms are detailed. A particular focus is put on the computation of minimum float, which remains an N P hard optimization problem. For this last case, a recent and efficient branch and bound algorithm is described that outperforms previously proposed methods.