Bounding Distributions for a Stochastic Acyclic Network
From MaRDI portal
Cited in
(27)- An upper bound on the expected completion time of PERT networks
- Approximating the distribution functions in stochastic networks
- Probabilistic shortest path problems with budgetary constraints
- Bounding the expected time-cost curve for a stochastic PERT network from below
- A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network
- A factoring approach for the stochastic shortest path problem
- On criticality and sensitivity in activity networks
- Improving project cost estimation by taking into account managerial flexibility
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Stochastic and fuzzy PERT
- A new structural mechanism for reducibility of stochastic PERT networks
- Solving linear programs with multiple right-hand sides: Pricing and ordering schemes
- Risk taking in stochastic PERT networks
- Adjustment of the moments of the project completion times when activity times are exponentially distributed
- Persistence in discrete optimization under data uncertainty
- Distributionally robust mixed integer linear programs: persistency models with applications
- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems
- Stochastic activity networks: a four-parameter approach for completion times
- Extremal probability bounds in combinatorial optimization
- Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
- Stochastic networks and the extreme value distribution
- The exact overall time distribution of a project with uncertain task durations
- Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams
- Criticality analysis of activity networks under interval uncertainty
- Analysis of the impact of corrective actions for stochastic project networks
- An approximate solution to the PERT problem
- An optimization model for stochastic project networks with cash flows
This page was built for publication: Bounding Distributions for a Stochastic Acyclic Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5661692)