Technical Note—Expected Completion Time in Pert Networks

DOI10.1287/opre.24.1.177zbMath0324.90025OpenAlexW2078236219MaRDI QIDQ4088548

Michel Trahan, Pierre N. Robillard

Publication date: 1976

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

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

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Related Items

Risk taking in stochastic PERT networks, Longest path analysis in networks of queues: dynamic scheduling problems, An optimization model for stochastic project networks with cash flows, An approach to pert: application of dirichlet distribution, A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network, A Note on Bounds for the Moments of a Stochastic Project Planniag Model Duration, Stochastic activity networks: a four-parameter approach for completion times, Lower bound for the mean project completion time in dynamic PERT networks, Time-cost trade-off via optimal control theory in Markov PERT networks, A multi-objective resource allocation problem in PERT networks, A review of the contribution of operational research to project management, Integrating risk into estimations of project activities' time and cost: a stratified approach, Resource-constrained project scheduling: Notation, classification, models, and methods, Unnamed Item, A new structural mechanism for reducibility of stochastic PERT networks