The following pages link to (Q3691403):
Displaying 10 items.
- An approximate solution to the PERT problem (Q751484) (← links)
- An upper bound on the expected completion time of PERT networks (Q1060947) (← links)
- Estimating the mean completion time of PERT networks with exponentially distributed durations of activities (Q1319548) (← links)
- COMPLETION TIMES IN NETWORKS—THE THEORY OF RELATIVELY CLOSED SYSTEMS APPLIED TO MAXIMUM OPERATORS (Q3026722) (← links)
- Some remarks on the expected delay of project duration in a PERT network (Q3346077) (← links)
- Note sur les problèmes d'ordonnancement PERT aléatoires (Q3686480) (← links)
- Two-point approximations for activity times in PERT networks (Q3693242) (← links)
- Bounding the Project Completion Time Distribution in PERT Networks (Q3703645) (← links)
- A Simple Approximation to the Completion Time Distribution for a PERT Network (Q3984312) (← links)
- Computing bounds on project duration distributions for stochastic PERT networks (Q4526866) (← links)
