The Most Critical Path in a PERT Network
From MaRDI portal
Recommendations
- The most critical path in a PERT network: A heuristic approach
- Determining the K Most Critical Paths in PERT Networks
- Risk taking in stochastic PERT networks
- A new probabilistic approach to the path criticality in stochastic PERT
- Approximating the Criticality Indices of the Activities in PERT Networks
Cited in
(16)- Evaluating project completion time in project networks with discrete random activity durations
- A parametric critical path problem and an application for cyclic scheduling
- Critical path in an activity network with time constraints
- The most critical path in a PERT network: A heuristic approach
- Finding the critical path in an activity network with time-switch constraints
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Small-m method for detecting all longest paths
- Risk taking in stochastic PERT networks
- Determining the K Most Critical Paths in PERT Networks
- Critical path planning under uncertainty
- scientific article; zbMATH DE number 3939115 (Why is no real title available?)
- A new probabilistic approach to the path criticality in stochastic PERT
- New bounds and approximations for the probability distribution of the length of the critical path
- The chance constrained critical path with location-scale distributions
- Longest path analysis in networks of queues: dynamic scheduling problems
- Almost sure critical paths
This page was built for publication: The Most Critical Path in a PERT Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287635)
