pub struct PertApproximation {
pub mean_hours: f64,
pub variance_hours2: f64,
pub sigma_hours: f64,
pub path: Vec<WorkItemId>,
pub activity_variance_hours2: BTreeMap<WorkItemId, f64>,
}Expand description
Normal approximation of the project finish along one mean critical path.
Fields§
§mean_hours: f64Deterministic project finish in elapsed hours; without calendars it is the sum of the path’s PERT means and lags.
variance_hours2: f64Sum of the classical PERT variances of the durations the path’s finish depends on. On a
calendar these are working hours, not the elapsed hours of mean_hours, so the spread of
the elapsed finish is understated and the approximation is more confident still.
sigma_hours: f64Square root of variance_hours2.
path: Vec<WorkItemId>The mean critical path from its first activity to the one that sets the project finish.
activity_variance_hours2: BTreeMap<WorkItemId, f64>Classical PERT variance of every projected activity’s remaining duration: zero for finished or exactly known work, and for started work the range its elapsed time allows.
Implementations§
Source§impl PertApproximation
impl PertApproximation
Sourcepub fn probability_by(&self, horizon_hours: f64) -> f64
pub fn probability_by(&self, horizon_hours: f64) -> f64
Φ((H − mean) / σ); a path without variance finishes by H exactly when its mean does.