Pages that link to "Item:Q3337928"
From MaRDI portal
The following pages link to Determining the <i>K</i> Most Critical Paths in PERT Networks (Q3337928):
Displaying 15 items.
- Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming (Q319710) (← links)
- A new probabilistic approach to the path criticality in stochastic PERT (Q441034) (← links)
- A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing (Q833427) (← links)
- A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept (Q852940) (← links)
- A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658) (← links)
- A parametric critical path problem and an application for cyclic scheduling (Q1270778) (← 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)
- A new approach to determine the critical path in stochastic activity network (Q1718645) (← links)
- Path critical index and activity critical index in PERT networks (Q1848623) (← links)
- A new structural mechanism for reducibility of stochastic PERT networks (Q1869478) (← links)
- Risk taking in stochastic PERT networks (Q2367367) (← links)
- Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty (Q2957465) (← links)
- The Most Critical Path in a PERT Network (Q4287635) (← links)
- Network Criticality with Multiple Work-Patterns (Q4305771) (← links)
