The Completion Time of PERT Networks

DOI10.2307/2581100MaRDI QIDQ3968744zbMATH OpenOpenAlexFDO

Authors Domenic Sculli

Publication date 1983

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2581100

zbMATH Keywords

activity schedulingapproximationcompletion time meancompletion time variancePERT networksrandom activity durations

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99) Deterministic scheduling theory in operations research (90B35)

Cited in

(16)

• An upper bound on the expected completion time of PERT networks
• Critical path in an activity network with time constraints
• Approximating probability density functions and their convolutions using orthogonal polynomials
• Finding the critical path in an activity network with time-switch constraints
• Improving project cost estimation by taking into account managerial flexibility
• A new structural mechanism for reducibility of stochastic PERT networks
• Risk taking in stochastic PERT networks
• Adjustment of the moments of the project completion times when activity times are exponentially distributed
• A new approximation algorithm for obtaining the probability distribution function for project completion time
• A new probabilistic approach to the path criticality in stochastic PERT
• Distribution of the Activity Time in Network Analysis: A Critical Revisit with a Gamma Alternative
• Solution of interval PERT/CPM network problems by a simplified tabular method
• Evaluating the project completion time when activity networks follow beta distribution
• Erlang distributed activity times in stochastic activity networks.
• Stochastic networks and the extreme value distribution
• An approximate solution to the PERT problem

This page was built for publication: The Completion Time of PERT Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3968744)