A Note on Bounds for the Moments of a Stochastic Project Planniag Model Duration
From MaRDI portal
Publication:3757672
Recommendations
- Bounding the distribution of project duration in PERT networks
- Lower bound for the mean project completion time in dynamic PERT networks
- scientific article; zbMATH DE number 3959110
- Computing bounds on project duration distributions for stochastic PERT networks
- Bounding the Project Completion Time Distribution in PERT Networks
Cites work
- scientific article; zbMATH DE number 3591262 (Why is no real title available?)
- scientific article; zbMATH DE number 3613959 (Why is no real title available?)
- Application of a technique for research and development program evaluation
- Convex majorization with an application to the length of critical paths
- Distribution of the Time Through a Directed, Acyclic Network
- Expected Critical Path Lengths in PERT Networks
- Technical Note—Expected Completion Time in Pert Networks
Cited in
(4)- A computational study on bounding the makespan distribution in stochastic project networks
- Bounds for the expectation of linear combinations of order statistics with application to pert networks
- A two-stage stochastic programming approach for project planning with uncertain activity durations
- scientific article; zbMATH DE number 3959110 (Why is no real title available?)
This page was built for publication: A Note on Bounds for the Moments of a Stochastic Project Planniag Model Duration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757672)