Risk taking in stochastic PERT networks
From MaRDI portal
Publication:2367367
DOI10.1016/0377-2217(93)90063-SzbMath0773.90029MaRDI QIDQ2367367
Publication date: 25 October 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35)
Related Items (3)
Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Critical path in an activity network with time constraints ⋮ Finding the critical path in an activity network with time-switch constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The use of cutsets in Monte Carlo analysis of stochastic networks
- An upper bound on the expected completion time of PERT networks
- Optimal paths in probabilistic networks: A case with temporary preferences
- Stochastisches PERT — Eine vergleichende Untersuchung über die Effizienz eines Verfahrens zur stochastischen Projektplanung
- Determining the K Most Critical Paths in PERT Networks
- Some remarks on the expected delay of project duration in a PERT network
- Two-point approximations for activity times in PERT networks
- Normally Distributed Activity Durations in PERT Networks
- Bounding the Project Completion Time Distribution in PERT Networks
- A Multivariate Approach to Estimating the Completion Time for PERT Networks
- Some Results Concerning the Estimation of Beta Distribution Parameters in PERT
- Estimating Network Characteristics in Stochastic Activity Networks
- Approximating the Criticality Indices of the Activities in PERT Networks
- Stochastic Bounds on Distributions of Optimal Value Functions with Applications to PERT, Network Flows and Reliability
- On the Distribution of Activity Time in PERT
- Inequalities for the Completion Times of Stochastic PERT Networks
- The Completion Time of PERT Networks
- Technical Note—Expected Completion Time in Pert Networks
- Another Look at the PERT Assumptions
- The Completion Time of PERT Networks
- Markov and Markov-Regenerative <scp>pert</scp> Networks
- Three-Point Approximations for Continuous Random Variables
- Application of a Technique for Research and Development Program Evaluation
- Expected Critical Path Lengths in PERT Networks
- Letter to the Editor—A Modification of Fulkerson's PERT Algorithm
- Critical Path Analyses Via Chance Constrained and Stochastic Programming
- Distribution of the Time Through a Directed, Acyclic Network
- A Statistical Theory for PERT Critical Path Analysis
- On the Expected Duration of PERT Type Networks
- Prior Probabilities
- The Greatest of a Finite Set of Random Variables
- A Statistical Theory for Pert in Which Completion Times of Activities are Inter-Dependent
- Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis
- More on Conditioned Sampling in the Simulation of Stochastic Networks
- An Estimate of Expected Critical-Path Length in PERT Networks
- Bounding Distributions for a Stochastic Acyclic Network
This page was built for publication: Risk taking in stochastic PERT networks