Skip to Main content Skip to Navigation
New interface
Conference papers

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.
Complete list of metadata

https://hal.inria.fr/hal-03408414
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, October 29, 2021 - 10:23:27 AM
Last modification on : Friday, November 18, 2022 - 9:38:04 AM
Long-term archiving on: : Monday, January 31, 2022 - 9:39:13 AM

File

493186_1_En_10_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

16

Files downloads

11