An upper bound on the expected completion time of PERT networks

DOI10.1016/0377-2217(85)90032-3zbMath0569.90047OpenAlexW2010647031MaRDI QIDQ1060947

Jerzy Kamburowski

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90032-3

zbMATH Keywords

upper boundPERT networkcritical path programmingexpected project completion timeNBUE class

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items (18)

Risk taking in stochastic PERT networks ⋮ A classified bibliography of recent research relating to project risk management ⋮ Adjustment of the moments of the project completion times when activity times are exponentially distributed ⋮ Bounds for the expectation of linear combinations of order statistics with application to pert networks ⋮ A new approach to determine the critical path in stochastic activity network ⋮ Game-theoretic modeling of the project management contract ⋮ Solution of interval PERT/CPM network problems by a simplified tabular method ⋮ Evaluating the project completion time when activity networks follow beta distribution ⋮ Chance-constrained programming in activity networks: A critical evaluation ⋮ Evaluating project completion times when activity times are Weibull distributed ⋮ A Laplace transform method for order statistics from nonidentical random variables and its application in phase-type distribution ⋮ The computational complexity of the criticality problems in a network with interval activity times ⋮ Critical path in an activity network with time constraints ⋮ Unnamed Item ⋮ Finding the critical path in an activity network with time-switch constraints ⋮ Estimating the mean completion time of PERT networks with exponentially distributed durations of activities ⋮ A new structural mechanism for reducibility of stochastic PERT networks ⋮ Stochastic activity networks with truncated exponential activity times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A moment method for solving stochastic time problems in network planning
• Inequalities for the Completion Times of Stochastic PERT Networks
• The Completion Time of PERT Networks
• Application of a Technique for Research and Development Program Evaluation
• A Statistical Theory for PERT Critical Path Analysis
• On the Expected Duration of PERT Type Networks
• The Greatest of a Finite Set of Random Variables
• Numerical Operators for Statistical PERT Critical Path Analysis
• Bounding Distributions for a Stochastic Acyclic Network

This page was built for publication: An upper bound on the expected completion time of PERT networks