Pages that link to "Item:Q4779269"
From MaRDI portal
The following pages link to A hierarchical approach for bounding the completion time distribution of stochastic task graphs (Q4779269):
Displaying 4 items.
- Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements (Q977005) (← links)
- Methodology for Stochastic Graph Completion-Time Problems (Q4367048) (← links)
- Estimating completion-time distribution in stochastic activity networks (Q5464246) (← links)
- Analysis of the impact of corrective actions for stochastic project networks (Q6565390) (← links)