Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations

DOI10.1002/NET.20125MaRDI QIDQ3423883zbMATH OpenOpenAlexFDO

Authors Lawrence M. Leemis, Matthew J. Duggan, John H. Drew, Jeffrey A. Mallozzi, Kerry W. Connell

Publication date 15 February 2007

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20125

zbMATH Keywords

recursionconditional probabilitycomputer algebra systemseries-parallel reduction

Mathematics Subject Classification ID

Combinatorial probability (60C05) Stochastic network models in operations research (90B15)

Recommendations

• Computing the probability distribution of project duration in a PERT network
• Computing bounds on project duration distributions for stochastic PERT networks
• Minimum Number Of Arcs In Conditional Monte Carlo Sampling Of Stochastic Networks
• Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG
• Stochastic networks and the extreme value distribution

Cited in

(7)

• An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths
• Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG
• Minimum Number Of Arcs In Conditional Monte Carlo Sampling Of Stochastic Networks
• Stochastic networks and the extreme value distribution
• Structured construction and simulation of nondeterministic stochastic activity networks
• Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
• Network reliability: Heading out on the highway

Describes a project that uses

Uses Software

• APPL

This page was built for publication: Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations

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