The exact overall time distribution of a project with uncertain task durations
From MaRDI portal
Publication:5928451
DOI10.1016/S0377-2217(99)00316-1zbMath0974.90510MaRDI QIDQ5928451
Ignacio E. Grossmann, Craig W. Schmidt
Publication date: 13 December 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Management decision making, including multiple objectives (90B50) Applications of statistics (62P99)
Related Items
A new probabilistic approach to the path criticality in stochastic PERT ⋮ Lower bound for the mean project completion time in dynamic PERT networks ⋮ Mixture densities for project management activity times: A robust approach to PERT ⋮ Time-cost trade-off via optimal control theory in Markov PERT networks ⋮ Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integration of polynomials over \(n\)-dimensional polyhedra
- Methods of evaluating \(n\)-dimensiona integrals with polytope bounds
- Computing the probability distribution of project duration in a PERT network
- Letter to the Editor—Bibliography on Project Planning and Control by Network Analysis: 1959–1961
- Bounding the Project Completion Time Distribution in PERT Networks
- Digraphs with maximum number of paths and cycles
- A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
- Comment construire un graphe PERT minimal
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- Integration on a convex polytope
- Dividing a Graph into Triconnected Components
- Application of a Technique for Research and Development Program Evaluation
- Distribution of the Time Through a Directed, Acyclic Network
- A Statistical Theory for PERT Critical Path Analysis
- On direction-preserving maps of graphs
- Numerical Operators for Statistical PERT Critical Path Analysis
- Bounding Distributions for a Stochastic Acyclic Network
