← Research library
SCHEMATEX / RESEARCH NOTEWorked analysis · Project controls

PERT critical path: expected time, float, and a worked network

Turn seven three-point activity estimates into a 19.17-day schedule, prove the A-C-D-F-G critical path, and separate deterministic PERT arithmetic from schedule risk analysis.

KEY RESULT19.17 days

expected duration on the A-C-D-F-G critical path

FIGURE 01 / REPRODUCIBLE OUTPUTSVG · SCHEMATEX
PERT network for instrument commissioning with seven activity boxes, a red A-C-D-F-G critical path, a 19.17-day expected duration, and float on two noncritical tasks
Rendered deterministically by Schematex 1.0.9 from the source reproduced here; the two footer summaries were stacked for mobile legibility, and every computed value was independently recalculated.

For a finish-to-start PERT network, calculate each activity's expected duration, run a forward pass for early times, run a backward pass for late times, and mark activities with zero total float as critical. In the worked instrument-commissioning schedule below, the expected project duration is 19.17 days; the critical path is A-C-D-F-G; task B has 0.67 day of total float, and task E has 1.00 day.

Instrument-commissioning PERT network with seven activity boxes, the A-C-D-F-G critical path in red, and a computed duration of 19.17 days
Each box shows ES, expected duration, EF, LS, total float, and LF. Red boxes and connectors form the zero-float critical path; blue boxes have positive float.

Scope and terms before the calculation

NASA describes a network schedule as a way to express activity dependencies and calculate project duration, critical activities, and float. The U.S. Department of Energy's project-scheduling tutorial separates the two passes: the forward pass calculates Early Start (ES) and Early Finish (EF), while the backward pass calculates Late Start (LS) and Late Finish (LF).

This example combines those network calculations with classic three-point PERT estimates:

  • Optimistic (O) is the short duration under favorable stated conditions.
  • Most likely (M) is the modal working estimate, not an arithmetic midpoint.
  • Pessimistic (P) is the long duration under unfavorable stated conditions.
  • Expected duration (te) is the classic weighted estimate (O + 4M + P) / 6.
  • Total float is LS - ES, equivalently LF - EF: how long an activity can move without moving the modeled project finish.
  • Critical path is the longest dependent path through this deterministic network. With no imposed date constraints, its activities have zero total float.

All durations here are fictional working days. Every dependency is Finish-to-Start with zero lag, the network starts at time zero, resources are assumed available, and no calendar, progress, hard constraint, rework loop, or correlation is modeled. The example schedules a plan; it does not forecast a guaranteed completion date.

Inputs and three-point arithmetic

For every activity, use the same two formulas:

te = (O + 4M + P) / 6
variance = ((P - O) / 6)^2

The DOE tutorial documents the weighted-mean formula. Schematex 1.0.9 also reports the classic variance approximation for each O/M/P triple. For task B, Site readiness:

te_B = (3 + 4×5 + 9) / 6
     = 32 / 6
     = 5.3333 days

variance_B = ((9 - 3) / 6)^2
           = 1.0000 day^2

Apply the same arithmetic before rounding display values:

IDActivityPredecessor(s)O / M / P (days)te (days)Variance (day²)
ARequirements review2 / 3 / 43.00000.1111
BSite readinessA3 / 5 / 95.33331.0000
CEquipment configurationA4 / 6 / 86.00000.4444
DInterface verificationB, C2 / 4 / 64.00000.4444
EOperator trainingC2 / 3 / 43.00000.1111
FAcceptance testD, E3 / 5 / 75.00000.4444
GHandoverF1 / 1 / 21.16670.0278

The estimates must satisfy O ≤ M ≤ P, use one time unit, and describe the same scope and resource assumptions. A mathematically valid triple cannot repair a missing predecessor or an undefined activity.

Reproducible Schematex source

pert "Instrument commissioning"
  unit: days
  direction: TB
  critical-tolerance: 0.01
  task A "Requirements review" duration: 2/3/4
  task B "Site readiness" duration: 3/5/9 after: A
  task C "Equipment configuration" duration: 4/6/8 after: A
  task D "Interface verification" duration: 2/4/6 after: B, C
  task E "Operator training" duration: 2/3/4 after: C
  task F "Acceptance test" duration: 3/5/7 after: D, E
  task G "Handover" duration: 1/1/2 after: F

This source was validated and rendered with Schematex 1.0.9 on August 16, 2026. Its PERT syntax reference defines duration: O/M/P, computes te, performs both passes, and places the six calculated fields in each activity box. critical-tolerance: 0.01 prevents harmless floating-point residue from hiding a mathematically zero-float path.

Forward pass: calculate the earliest finish

For an activity with no predecessor, ES = 0. For every other Finish-to-Start activity, ES is the largest EF among its predecessors. Then EF = ES + te.

A: ES 0.00  → EF  3.00
B: ES 3.00  → EF  8.33
C: ES 3.00  → EF  9.00
D: ES max(8.33, 9.00) = 9.00 → EF 13.00
E: ES 9.00  → EF 12.00
F: ES max(13.00, 12.00) = 13.00 → EF 18.00
G: ES 18.00 → EF 19.17

The merge at D matters: Site readiness finishes at 8.33, but Equipment configuration finishes at 9.00, so D cannot start before day 9.00. The later predecessor controls the merge. The same rule makes D, not E, control the start of Acceptance test at day 13.00.

Backward pass: expose float and the critical path

Start at the modeled project finish: LF_G = 19.1667. For each activity, LS = LF - te. Moving backward, an activity's LF is the smallest LS among its successors.

IDESEFLSLFTotal floatCritical?
A0.003.000.003.000.00yes
B3.008.333.679.000.67no
C3.009.003.009.000.00yes
D9.0013.009.0013.000.00yes
E9.0012.0010.0013.001.00no
F13.0018.0013.0018.000.00yes
G18.0019.1718.0019.170.00yes

The zero-float chain is therefore A-C-D-F-G. Its unrounded expected durations reconcile to the project result:

te_project = 3 + 6 + 4 + 5 + 7/6
           = 115/6
           = 19.1667 days
           ≈ 19.17 days

Task B may move by 0.6667 day before it delays D. Task E may move by 1.0000 day before it delays F. GAO cautions that total float is shared along a path: spending it on one activity leaves less flexibility for downstream work. Float is schedule flexibility, not free labor or permission to ignore the task.

Checks that should pass before using the result

Recalculate the table or inspect the SVG's machine-readable task attributes, then verify:

  1. For every task, EF - ES = te and LF - LS = te.
  2. LS - ES = LF - EF = total float.
  3. Every Finish-to-Start successor begins no earlier than every predecessor finishes.
  4. Both merge nodes use the maximum predecessor EF in the forward pass.
  5. The critical chain is continuous from project start to finish and sums to 19.1667 days before display rounding.
  6. Noncritical tasks B and E have nonnegative float of 0.6667 and 1.0000 day; no unexplained negative float appears.
  7. Increasing B's most-likely duration from 5 to 7 days makes B finish at 9.67, shifts the critical branch through B, and increases the project result to 19.83 days. A static picture that does not respond has not preserved the schedule logic.

Common failures are adding parallel durations instead of taking the later merge, rounding activity durations before the passes, treating float as independent on every activity, omitting a handoff, and calling the most visually prominent path “critical” without computing late times.

Why 19.17 days is not a completion confidence

The PERT weighted mean and summed critical-path variance are compact approximations. For this path, Schematex reports:

critical-path variance
  = 0.1111 + 0.4444 + 0.4444 + 0.4444 + 0.0278
  = 1.4722 day^2

critical-path σ = sqrt(1.4722) = 1.2134 days ≈ 1.21 days

That σ is not enough to claim “95% likely by” any date. GAO-16-89G describes schedule risk analysis as a statistical simulation over uncertain activity durations, risks, and network logic; it also warns that parallel-path merge bias and changing critical paths matter. Correlation, discrete risk events, resource limits, calendars, and alternate paths are absent here. Treat 19.17 days as the expected-duration result of the stated deterministic approximation, not as a probability-backed promise.

Paste the source into the Schematex playground, confirm the invariants above, and then replace one fictional triple at a time with an estimate whose scope, owner, evidence, calendar, and uncertainty basis are documented. If the network will support a committed date, export it to a controlled scheduling and risk-analysis process rather than extending this teaching model past its boundary.

References

  1. U.S. Department of Energy. Earned Value Management Tutorial: Module 3 - Project Scheduling. EVM Tutorial Module 3, Project scheduling module. https://www.energy.gov/sites/prod/files/maprod/documents/EVMModule3.pdf Accessed August 16, 2026.
  2. National Aeronautics and Space Administration. NASA Systems Engineering Handbook: Technical Planning. NASA/SP-2016-6105 Rev 2, Section 6.1, Revision 2, 2016. https://www.nasa.gov/reference/6-1-technical-planning/ Accessed August 16, 2026.
  3. U.S. Government Accountability Office. Schedule Assessment Guide: Best Practices for Project Schedules. GAO-16-89G, Applied Research and Methods guide, 2015. https://www.gao.gov/products/gao-16-89g Accessed August 16, 2026.
  4. Schematex Project. PERT / CPM Network syntax reference. Schematex 1.0.9 documentation, 2026. https://schematex.js.org/docs/pert Accessed August 16, 2026.

Cite this article

Rowan Beck. “PERT critical path: expected time, float, and a worked network.” Schematex Research. Version 2026-08-16. Updated August 16, 2026. https://schematex.js.org/research/pert-critical-path-worked-example