scientific article; zbMATH DE number 6026942
From MaRDI portal
Publication:5389708
zbMath1249.90305MaRDI QIDQ5389708
Publication date: 23 April 2012
Full work available at URL: https://eudml.org/doc/33649
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Elementary classical functions (33B99)
Related Items (4)
Adjustment of the moments of the project completion times when activity times are exponentially distributed ⋮ Evaluating the project completion time when activity networks follow beta distribution ⋮ A Laplace transform method for order statistics from nonidentical random variables and its application in phase-type distribution ⋮ A method for obtaining Laplace transforms of order statistics of Erlang random variables
Cites Work
- Unnamed Item
- An upper bound on the expected completion time of PERT networks
- Estimating the mean completion time of PERT networks with exponentially distributed durations of activities
- On criticality and sensitivity in activity networks
- Normally Distributed Activity Durations in PERT Networks
- Inequalities for the Completion Times of Stochastic PERT Networks
- The Completion Time of PERT Networks
- Technical Note—Expected Completion Time in Pert Networks
- A Comparison Of Variance Reducing Techniques In Pert Simulations
- Markov and Markov-Regenerative <scp>pert</scp> Networks
- Evaluating Project Completion Times When Activity Times are Erlang Distributed
- Expected Critical Path Lengths in PERT Networks
- On the Expected Duration of PERT Type Networks
- A review of the contribution of operational research to project management
This page was built for publication:
