Letter to the Editor—A Modification of Fulkerson's PERT Algorithm

Abstract

Fulkerson has described a method for approximating expected earliest start times in a pert network in which activity durations are discrete random variables. This letter describes an extension of Fulkerson's algorithm to include the continuous case and derives a computationally feasible form for this algorithm.