Engineering Knowledge Cards.
Confidence HighUpdated 2026-10-18

Computing the six time parameters (ES/EF/LS/LF/TF/FF) of activity-on-arrow networks by the activity method: the recursions, the order of computation, identifying critical activities, and the TF >= FF self-consistency check

Per JGJ/T 121-2015 clause 4.3.1: forwards along the arrows take max (start activities ES = 0; others ES = max of predecessors' EF; EF = ES + D; Tc = max of end activities' EF; without a required duration Tp = Tc); backwards against the arrows take min (end activities LF = Tp; others LF = min of successors' LS; LS = LF - D); TF = LS - ES = LF - EF; FF = min of successors' ES - EF (end activities FF = Tp - EF). Activities with the least total float are critical (TF = 0 when Tp = Tc); the path of critical activities or of longest total duration is critical. Back-check: the two TF expressions must agree and TF >= FF always - FF > TF means the given data are inconsistent; recheck the successors' early starts, the activity's late start or the planned duration.

Applicable Codes

  • JGJ/T 121-2015 · Specification for Engineering Network Planning Technology 第4.3.1条(按工作计算法)
  • JGJ/T 121-2015 第4.3.2条(节点最早时间)
  • JGJ/T 121-2015 第4.5.1条(关键工作和关键线路)
  • JGJ/T 121-2015 第2.1.32、2.1.33条(自由时差、总时差术语)

Positioning

The standard formulas, order and checking method for the six time parameters of activity-on-arrow networks by the activity method - ES (earliest start), EF (earliest finish), LS (latest start), LF (latest finish), TF (total float), FF (free float) - plus the criteria for critical activities and paths (JGJ/T 121-2015 clauses 4.3.1 and 4.5.1).

Core conclusions

Premises and notation (clause 4.3.1 items 1-2): "Time parameters are computed after each activity's duration is fixed. Dummy activities are computed as activities of zero duration." Results are marked ES, EF, LS, LF, TF, FF and duration D (Figure 4.3.1).

Definitions (terms 2.1.32, 2.1.33): free float - "the spare time an activity can use without affecting the early starts of its immediate successors and any prescribed time limits"; total float - "the spare time an activity can use without affecting the duration and any prescribed time limits".

Step 1 - forwards for ES, EF (along arrows, always max)

  • Activities leaving the start node: ES = 0 unless prescribed (formula 4.3.1-1);
  • others: ES(i-j) = max of (ES(h-i) + D(h-i)) over predecessors h-i - the max of the predecessors' earliest finishes (4.3.1-2);
  • EF(i-j) = ES(i-j) + D(i-j) (4.3.1-3);
  • computed duration Tc = max of EF of activities ending at the end node (4.3.1-4);
  • planned duration Tp: with a required duration Tr, Tp <= Tr (in practice usually Tp = Tr); without, Tp = Tc (4.3.1-6).

Step 2 - backwards for LF, LS (against arrows, always min)

  • activities ending at the end node: LF(i-n) = Tp (4.3.1-7);
  • others: LF(i-j) = min of (LF(j-k) - D(j-k)) = min of successors' LS (4.3.1-8);
  • LS(i-j) = LF(i-j) - D(i-j) (4.3.1-9).

Step 3 - floats

  • total float TF(i-j) = LS - ES = LF - EF (4.3.1-10/-11; the two must agree - a cross-check);
  • free float: with successors, FF(i-j) = min of successors' ES - EF(i-j) (4.3.1-12/-13); activities ending at the end node: FF(i-n) = Tp - EF(i-n) (4.3.1-14/-15);
  • free float inside a dummy arrow belongs to its predecessor.

Step 4 - critical activities and path (clause 4.5.1)

  • "Activities with the least total float are critical"; "the path wholly of critical activities from start to end, or of longest total duration, is critical" - mark bold, double or coloured;
  • with Tp = Tc (uncompressed) TF = 0 identifies critical activities; with Tp < Tc the least TF (possibly non-zero) does;
  • where only the duration and critical path are needed, use node labelling: b1 = 0 at the start, bj = ETj = max(ETi + Dij) in numbering order, double-labelled with value and source; Tc is the end node's label; tracing sources backwards gives the path (clause 4.3.2 item 2, clause 4.5.1 item 3).

Step 5 - self-consistency check (mandatory when back-solving given data)

  1. TF = LS - ES must equal TF = LF - EF;
  2. TF >= FF always: TF - FF = min of successors' LS - min of successors' ES >= 0 (each successor has LS >= ES). An FF > TF means the data conflict - recheck the successors' early starts, the activity's late start (or finish), or the planned duration.
  3. Check LF against successor constraints: with successors at early starts (critical), LF = min of successors' ES and LS = that minus D gives the activity's minimum possible total float; a given LS below it is inconsistent.
  4. Example (ES = 12, D = 5, min successor ES = 21, LS = 15): EF = 17; FF = 21 - 17 = 4; LF = 15 + 5 = 20; TF = 15 - 12 = 20 - 17 = 3. FF(4) > TF(3) violates TF >= FF - inconsistent. Two repairs: successor ES actually 20 gives FF = 3 = TF; or LS actually 16 (LF = 21) gives TF = 4 = FF.

Applicable boundaries

  • For AOA networks by the activity method (activities as computation units); AON and AON with FTS/STS/FTF/STF lags follow chapter 5 of the code.
  • Premise: durations fixed and logic fixed; dummies take D = 0 and join the computation.
  • "TF = 0 = critical" only when Tp = Tc; with a required or compressed duration, judge by least total float.
  • Forwards max and backwards min never swap; with several successors FF takes the minimum of their ES - omitting the min overstates the free float.
  • The formulas carry no resource limits, no overlaps, and do not fit PERT (three-time estimates); nor do they solve compression or resource levelling - later optimisation stages.

Further reading

  • JGJ/T 121-2015 clause 4.3.1 (formulas 4.3.1-1~-15 and Figure 4.3.1), clause 4.3.2, clause 4.5.1, terms 2.1.32/2.1.33; its commentary example (Figure 5): Tc = Tp = 22, critical paths 1-2-3-5-6-7-10-11-12-13-15 and ...-14-15 (results in Figures 6 and 11).

Keywords

Cited By