Pages that link to "Item:Q3984312"
From MaRDI portal
The following pages link to A Simple Approximation to the Completion Time Distribution for a PERT Network (Q3984312):
Displaying 12 items.
- Solution of interval PERT/CPM network problems by a simplified tabular method (Q505096) (← links)
- An approximate solution to the PERT problem (Q751484) (← links)
- Longest path analysis in networks of queues: dynamic scheduling problems (Q858339) (← links)
- A proposal on improved procedures for estimating task-time distributions in PERT (Q1127234) (← links)
- Bounding the distribution of project duration in PERT networks (Q1200756) (← links)
- A new approximation algorithm for obtaining the probability distribution function for project completion time (Q2460585) (← links)
- Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty (Q2957465) (← links)
- (Q3149926) (← links)
- Some remarks on the expected delay of project duration in a PERT network (Q3346077) (← links)
- (Q3691403) (← links)
- Two-point approximations for activity times in PERT networks (Q3693242) (← links)
- A New Approach to the Activity-time Distribution in PERT (Q3818784) (← links)