Article ID: | iaor20011744 |
Country: | Netherlands |
Volume: | 126 |
Issue: | 3 |
Start Page Number: | 614 |
End Page Number: | 636 |
Publication Date: | Nov 2000 |
Journal: | European Journal of Operational Research |
Authors: | Grossmann Ignacio E., Schmidt Craig W. |
Keywords: | graphs |
This paper presents a new technique for computing the exact overall duration of a project, when task durations have independent distributions. A project is represented as an Activity-on-Arc (AoA) graph, where a task begins as soon as all its predecessor tasks have finished. Task durations use a probability density function (p.d.f.) which combines piecewise polynomial segments and Dirac delta functions, defined over a finite interval. A semi-analytical procedure is proposed to compute the cumulative distribution function (c.d.f.) directly by integrating a linear transformation of the p.d.f. of the task durations. Graph reduction techniques by Hopcroft and Tarjan and by Valdes allow the problem to be broken into a series of smaller subproblems, improving computational efficiency. Examples are presented to illustrate the proposed method.