An upper bound on the expected completion time of PERT networks (Q1060947)

From MaRDI portal
Revision as of 17:24, 14 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An upper bound on the expected completion time of PERT networks
scientific article

    Statements

    An upper bound on the expected completion time of PERT networks (English)
    0 references
    0 references
    1985
    0 references
    The problem of determining an upper bound on the expected project completion time, described by the PERT network, is considered. It is assumed that activity durations are independent random variables with given means. The exact forms of probability distributions do not have to be known; however, their cumulative distribution functions are expected to belong to the so-called NBUE class. Very simple algorithms for deriving this bound are presented. The computations can even be performed manually for more involved networks. Our approach producing a pessimistic evaluation of the expected value of the project duration, extends considerably the information obtained through the use of the classical PERT that always underestimates this value. The results are illustrated by a simple example, and errors of approximations are discussed.
    0 references
    critical path programming
    0 references
    upper bound
    0 references
    expected project completion time
    0 references
    PERT network
    0 references
    NBUE class
    0 references

    Identifiers