Expected Critical Path Lengths in PERT Networks
From MaRDI portal
Publication:5328568
Cited in
(33)- On latest starting times and floats in activity networks with ill-known durations
- A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network
- Time-cost trade-off via optimal control theory in Markov PERT networks
- Extremal probability bounds in combinatorial optimization
- Stochastic networks and the extreme value distribution
- A review of the contribution of operational research to project management
- Bounding the expected time-cost curve for a stochastic PERT network from below
- A critical path generalization of the additive factor method: Analysis of a stroop task
- A multi-objective resource allocation problem in PERT networks
- Least squares approximation to the distribution of project completion times with Gaussian uncertainty
- Stochastic activity networks: a four-parameter approach for completion times
- Erlang distributed activity times in stochastic activity networks.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- An evolutionary approach for resource constrained project scheduling with uncertain changes
- Exploiting partial correlations in distributionally robust optimization
- Computing project makespan distributions: Markovian PERT networks revisited
- Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
- Lower bound for the mean project completion time in dynamic PERT networks
- An approximate solution to the PERT problem
- Evaluating project completion time in project networks with discrete random activity durations
- Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks
- When greediness fails: examples from stochastic scheduling.
- A factoring approach for the stochastic shortest path problem
- A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept
- A new structural mechanism for reducibility of stochastic PERT networks
- Stochastic and fuzzy PERT
- The bias of an estimate of coupled slack in stochastic PERT networks
- Risk taking in stochastic PERT networks
- Distributionally robust mixed integer linear programs: persistency models with applications
- An optimization model for stochastic project networks with cash flows
- Extended dominance and a stochastic shortest path problem
- Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams
- A Note on Bounds for the Moments of a Stochastic Project Planniag Model Duration
This page was built for publication: Expected Critical Path Lengths in PERT Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5328568)
