Pages that link to "Item:Q4138126"
From MaRDI portal
The following pages link to The Completion Time of PERT Networks (Q4138126):
Displayed 14 items.
- Solution of interval PERT/CPM network problems by a simplified tabular method (Q505096) (← links)
- Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams (Q595568) (← links)
- An approximate solution to the PERT problem (Q751484) (← links)
- Stochastic activity networks with truncated exponential activity times (Q815978) (← links)
- A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing (Q833427) (← links)
- A proposal on improved procedures for estimating task-time distributions in PERT (Q1127234) (← links)
- Critical path in an activity network with time constraints (Q1278077) (← links)
- Approximating probability density functions and their convolutions using orthogonal polynomials (Q1278378) (← links)
- The most critical path in a PERT network: A heuristic approach (Q1341990) (← links)
- Finding the critical path in an activity network with time-switch constraints (Q1579499) (← links)
- Computing project makespan distributions: Markovian PERT networks revisited (Q1634063) (← links)
- Stochastic and fuzzy PERT (Q1823843) (← links)
- A new structural mechanism for reducibility of stochastic PERT networks (Q1869478) (← links)
- Risk taking in stochastic PERT networks (Q2367367) (← links)