Pages that link to "Item:Q3968744"
From MaRDI portal
The following pages link to The Completion Time of PERT Networks (Q3968744):
Displaying 16 items.
- A new probabilistic approach to the path criticality in stochastic PERT (Q441034) (← links)
- Solution of interval PERT/CPM network problems by a simplified tabular method (Q505096) (← links)
- Stochastic networks and the extreme value distribution (Q584063) (← links)
- An approximate solution to the PERT problem (Q751484) (← links)
- An upper bound on the expected completion time of PERT networks (Q1060947) (← links)
- Critical path in an activity network with time constraints (Q1278077) (← links)
- Approximating probability density functions and their convolutions using orthogonal polynomials (Q1278378) (← links)
- Finding the critical path in an activity network with time-switch constraints (Q1579499) (← links)
- Improving project cost estimation by taking into account managerial flexibility (Q1590029) (← links)
- A new structural mechanism for reducibility of stochastic PERT networks (Q1869478) (← links)
- Risk taking in stochastic PERT networks (Q2367367) (← links)
- Adjustment of the moments of the project completion times when activity times are exponentially distributed (Q2430617) (← links)
- A new approximation algorithm for obtaining the probability distribution function for project completion time (Q2460585) (← links)
- Distribution of the Activity Time in Network Analysis: A Critical Revisit with a Gamma Alternative (Q4929163) (← links)
- Evaluating the project completion time when activity networks follow beta distribution (Q5164632) (← links)
- (Q5389708) (← links)
