Project completion time in dynamic PERT networks with generating projects
From MaRDI portal
Publication:3401786
Recommendations
- Computing project makespan distributions: Markovian PERT networks revisited
- Lower bound for the mean project completion time in dynamic PERT networks
- Markov and Markov-Regenerative <scp>pert</scp> Networks
- Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach
- scientific article; zbMATH DE number 3916004
Cited in
(9)- Computing project makespan distributions: Markovian PERT networks revisited
- Adjustment of the moments of the project completion times when activity times are exponentially distributed
- Lower bound for the mean project completion time in dynamic PERT networks
- Defining distribution functions of time for basic and extended Clark's flow for activities in PERT networks
- Some remarks on the expected delay of project duration in a PERT network
- scientific article; zbMATH DE number 3916004 (Why is no real title available?)
- Markov and Markov-Regenerative <scp>pert</scp> Networks
- Evaluating Project Completion Times When Activity Times are Erlang Distributed
- Performance variability and project dynamics
This page was built for publication: Project completion time in dynamic PERT networks with generating projects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401786)
