Skip to content

Business Mathematics and Statistics · Ch 10 — Operations Research (Linear Programming Problem, Network Analysis)

Critical Path Method (CPM)

5

Critical Path Method (CPM)

Once a project's network diagram is built and each activity's duration is known, the Critical Path Method (CPM) finds the shortest possible time in which the whole project can be completed, and identifies exactly which activities cannot be delayed without delaying the entire project.

Note

Earliest and Latest Event Times

  • Earliest Event Time (EE): the earliest possible time an event can occur, found by a forward pass through the network — for each event, EE is the largest of (the EE of every preceding event) plus (that activity's duration); at the very first event, E=0E=0.
  • Latest Event Time (LL): the latest an event can occur without delaying the project, found by a backward pass, starting from the last event (where L=EL=E for the final event) and working backward — for each event, LL is the smallest of (the LL of every succeeding event) minus (that activity's duration).
Note

Total Float of an Activity

Total Float=(Lhead event−Etail event)−Duration of the activity\text{Total Float} = (L_{\text{head event}} - E_{\text{tail event}}) - \text{Duration of the activity}

Float measures the spare time an activity has — how much it could be delayed without delaying the project overall.

Note

The Critical Path …

Definition 12Earliest Event Time (E)

The earliest possible time an event can occur, found by a forward pass through the network diagram, taking the largest sum of preceding EE plus activ …

Definition 13Latest Event Time (L)

The latest an event can occur without delaying the project, found by a backward pass from the final event, taking the smallest of succeeding LL minus acti …

Definition 14Total Float

The spare time an activity has: (Lhead−Etail)−duration(L_{\text{head}}-E_{\text{tail}})-\text{duration}; a value of zero means the a …

Definition 15Critical Path

The path from start to end event whose activities all have zero total float — the longest path through the network, whose total duration is the minimum possi …