A new structural mechanism for reducibility of stochastic PERT networks

DOI10.1016/S0377-2217(02)00155-8zbMath1012.90004MaRDI QIDQ1869478

Seyyed Mohammad Taghi Fatemi Ghomi, Masoud Rabbani

Publication date: 10 April 2003

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

zbMATH Keywords

graph theory; distribution function; stochastic network; network completion time; structural mechanism

Mathematics Subject Classification ID

05C90: Applications of graph theory

90B15: Stochastic network models in operations research

Related Items

Applying fuzzy method for measuring criticality in project network, 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

Cites Work

• Unnamed Item
• The use of cutsets in Monte Carlo analysis of stochastic networks
• An upper bound on the expected completion time of PERT networks
• Approximating the distribution functions in stochastic networks
• Determining the K Most Critical Paths in PERT Networks
• Bounding the Project Completion Time Distribution in PERT Networks
• Approximating the Criticality Indices of the Activities in PERT Networks
• The Completion Time of PERT Networks
• Technical Note—Expected Completion Time in Pert Networks
• The Completion Time of PERT Networks
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• Expected Critical Path Lengths in PERT Networks
• Letter to the Editor—A Modification of Fulkerson's PERT Algorithm
• Distribution of the Time Through a Directed, Acyclic Network
• A Statistical Theory for PERT Critical Path Analysis
• On the Expected Duration of PERT Type Networks
• Numerical Operators for Statistical PERT Critical Path Analysis
• An Estimate of Expected Critical-Path Length in PERT Networks
• Bounding Distributions for a Stochastic Acyclic Network