A Note on Bounds for the Moments of a Stochastic Project Planniag Model Duration
DOI10.1080/02522667.1986.10698863zbMATH Open0619.90039OpenAlexW2318168414MaRDI QIDQ3757672FDOQ3757672
Authors: Jerzy Kamburowski
Publication date: 1986
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1986.10698863
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
lower boundsPERT networksexpected project completion timestochastic project planningbounds for the momentsconvex partial ordering of probability distributions
Deterministic scheduling theory in operations research (90B35) Stochastic network models in operations research (90B15)
Cites Work
- Title not available (Why is that?)
- Convex majorization with an application to the length of critical paths
- Application of a Technique for Research and Development Program Evaluation
- Expected Critical Path Lengths in PERT Networks
- Distribution of the Time Through a Directed, Acyclic Network
- Title not available (Why is that?)
- Technical Note—Expected Completion Time in Pert Networks
Cited In (4)
- Title not available (Why is that?)
- 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
- A computational study on bounding the makespan distribution in stochastic project networks
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)