A Bounding Technique for Probabilistic PERT - Research and Practical Issues of Enterprise Information Systems - CONFENIS
Conference Papers Year : 2019

A Bounding Technique for Probabilistic PERT

Abstract

Bounding time distributions has been an effective way of improvements of the original PERT method. Analytical enhancement of PERT is often an effective time bounding approach. However, one thing that is missing today is a combination of time distributions which parameters can be effectively obtained empirically and the effective bounding technique for them. We aim at addressing this gap and suggest Cornish-Fisher expansion (CFE) to compute time bounds in formal models like the classical PERT.We argue that CFE allows us to evaluate analytically approximate time bounds easily without resort to simulations. This bounding approach is useful in case of complex distribution functions of task durations, because analytical derivation of project completion time distribution is tedious. Our example shows CFE usage for uniform time distributions and comparison with time bounds of classical PERT.
Fichier principal
Vignette du fichier
493186_1_En_10_Chapter.pdf (285.87 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03408414 , version 1 (29-10-2021)

Licence

Identifiers

Cite

Maksim Goman. A Bounding Technique for Probabilistic PERT. 13th International Conference on Research and Practical Issues of Enterprise Information Systems (CONFENIS), Dec 2019, Prague, Czech Republic. pp.112-122, ⟨10.1007/978-3-030-37632-1_10⟩. ⟨hal-03408414⟩
76 View
80 Download

Altmetric

Share

More