Bounding the Project Completion Time Distribution in PERT Networks
From MaRDI portal
Recommendations
- Bounding the distribution of project duration in PERT networks
- A computational study on bounding the makespan distribution in stochastic project networks
- An upper bound on the expected completion time of PERT networks
- Computing bounds on project duration distributions for stochastic PERT networks
- scientific article; zbMATH DE number 3916004
Cited in
(52)- Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
- An optimization model for stochastic project networks with cash flows
- A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing
- scientific article; zbMATH DE number 3959110 (Why is no real title available?)
- Lower bound for the mean project completion time in dynamic PERT networks
- Analysis of the impact of corrective actions for stochastic project networks
- Bounding the expected time-cost curve for a stochastic PERT network from below
- Normally Distributed Activity Durations in PERT Networks
- Computing latest starting times of activities in interval-valued networks with minimal time lags
- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems
- Least squares approximation to the distribution of project completion times with Gaussian uncertainty
- Mixture densities for project management activity times: A robust approach to PERT
- Approximating probability density functions and their convolutions using orthogonal polynomials
- Some remarks on the expected delay of project duration in a PERT network
- Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions
- On the latest starting times and criticality of activities in a network with imprecise durations
- Distributionally robust mixed integer linear programs: persistency models with applications
- Stochastic networks and the extreme value distribution
- A proposal on improved procedures for estimating task-time distributions in PERT
- Extremal probability bounds in combinatorial optimization
- On latest starting times and floats in activity networks with ill-known durations
- Allocating slacks in stochastic PERT network
- An approach to pert: application of dirichlet distribution
- A new probabilistic approach to the path criticality in stochastic PERT
- On path correlation and PERT bias
- The exact overall time distribution of a project with uncertain task durations
- Solving linear programs with multiple right-hand sides: Pricing and ordering schemes
- Evaluating project completion time in project networks with discrete random activity durations
- A classified bibliography of recent research relating to project risk management
- Risk taking in stochastic PERT networks
- Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Bounds for the expectation of linear combinations of order statistics with application to pert networks
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming
- A new structural mechanism for reducibility of stochastic PERT networks
- Global optima results for the Kauffman \(NK\) model
- A review of the contribution of operational research to project management
- Resource allocation for a stochastic CPM-type network through perturbation analysis
- The most critical path in a PERT network: A heuristic approach
- Bounding the distribution of project duration in PERT networks
- A computational study on bounding the makespan distribution in stochastic project networks
- A Note on Bounds for the Moments of a Stochastic Project Planniag Model Duration
- A dependent project evaluation and review technique: a Bayesian network approach
- scientific article; zbMATH DE number 3916004 (Why is no real title available?)
- On the Distribution of Activity Time in PERT
- Distribution of the Activity Time in Network Analysis: A Critical Revisit with a Gamma Alternative
- An upper bound on the expected completion time of PERT networks
- scientific article; zbMATH DE number 1808553 (Why is no real title available?)
- A hierarchical approach for bounding the completion time distribution of stochastic task graphs
- scientific article; zbMATH DE number 3976755 (Why is no real title available?)
- Evaluating the project completion time when activity networks follow beta distribution
- Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation
This page was built for publication: Bounding the Project Completion Time Distribution in PERT Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703645)