The Completion Time of PERT Networks

DOI10.1287/opre.25.1.15zbMath0363.68053OpenAlexW2076118120MaRDI QIDQ4138126

Pierre N. Robillard, Michel Trahan

Publication date: 1977

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.25.1.15

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) General topics in the theory of software (68N01)

Related Items

Risk taking in stochastic PERT networks, A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing, The most critical path in a PERT network: A heuristic approach, Computing project makespan distributions: Markovian PERT networks revisited, Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams, A proposal on improved procedures for estimating task-time distributions in PERT, Solution of interval PERT/CPM network problems by a simplified tabular method, An approximate solution to the PERT problem, Critical path in an activity network with time constraints, Approximating probability density functions and their convolutions using orthogonal polynomials, Stochastic and fuzzy PERT, Finding the critical path in an activity network with time-switch constraints, A new structural mechanism for reducibility of stochastic PERT networks, Stochastic activity networks with truncated exponential activity times