On computing the latest starting times and floats of activities in a network with imprecise durations

The paper deals with the problems of computing the intervals of possible values of the latest starting times and floats of activities in networks with imprecise durations, represented by means of interval or fuzzy numbers. So far, these problems have been completely solved when the networks are series parallel. We propose new polynomial algorithms for determining the intervals of the latest starting times in general networks. We also present some complexity results for floats (the computation of floats is probably intractable) and describe some polynomially solvable cases. Then we extend the results to networks with fuzzy durations.