Engineering Knowledge Cards.
Confidence HighUpdated 2026-10-18

Early-time activity-on-arrow time-scaled networks: the drawing rules, direct reading of ES/EF/free float off the diagram, the right-to-left recursion of total float, and the criterion that a path with no wave line from start to end is the critical path (JGJ/T 121-2015 clauses 4.4.1~4.4.3, 4.5.1, 4.5.2)

Per JGJ/T 121-2015: time-scaled networks draw activities as solid arrows, dummy activities as dashed arrows and free float as wave lines; node centres align with the time scale and their horizontal projection counts as zero. In an early-time network the node scale equals the node's earliest time (positioned at the max of the predecessors' earliest finishes), so free float = the horizontal projection of the wave-line part, earliest start = the tail node scale, earliest finish = the head node scale without a wave line or the right end of the solid line with one, and computed duration = the difference of the end and start node scales. Total float is derived right to left: for activities ending at the end node, Tp minus the activity's earliest finish; others TF = own free float + min of the successors' total floats (equivalently the minimum sum of wave-line projections along paths from the activity to the end). A path from start to end showing no wave line is the critical path, and its activities are critical.

Applicable Codes

  • 《工程网络计划技术规程》JGJ/T 121-2015 第4.4.1条
  • 《工程网络计划技术规程》JGJ/T 121-2015 第4.4.2条
  • 《工程网络计划技术规程》JGJ/T 121-2015 第4.4.3条(式4.4.3-1~4.4.3-4)
  • 《工程网络计划技术规程》JGJ/T 121-2015 第4.5.1条
  • 《工程网络计划技术规程》JGJ/T 121-2015 第4.5.2条
  • 《工程网络计划技术规程》JGJ/T 121-2015 第2.1.35条
  • 《工程网络计划技术规程》JGJ/T 121-2015 第4.3.1条、第4.3.2条

Positioning

Why an early-time activity-on-arrow time-scaled network lets floats be "read straight off the diagram": the symbol rules, the positioning of nodes at earliest times, the reading / recursion of free and total float, and why a wave-free path is critical. Basis: JGJ/T 121-2015 clauses 4.4.1, 4.4.2, 4.4.3, 4.5.1, 4.5.2 and term 2.1.35.

Core conclusions

1. Drawing basis (clause 4.4.1)

  1. The network uses a horizontal time scale; the time unit is fixed before drawing - hours, days, weeks, ten-days, months, quarters or years.
  2. Solid arrows are activities, dashed arrows dummy activities, wave lines the free float.
  3. All symbols' horizontal projections must match their time parameters; node centres align with the scale. Dummies are vertical dashed arrows, with wave lines where they carry free float (commentary: the wave line follows the solid arrow's end - never a solid line after a wave line; a node of any size is a point, its horizontal projection zero).

2. Drawing and node positioning (clause 4.4.2) Time-scaled networks should be drawn on earliest times. The commentary's reason: on earliest times the floats sit after each activity's early finish, where they are usable; drawn on latest times the floats sit before the latest starts, and once consumed an activity with float turns "critical" - latest-time drawing is discouraged.

  • Direct method: 1) put the start node on the initial scale line; 2) draw its outgoing arrows to duration; 3) each later start node is positioned at the maximum of its predecessors' earliest finishes once all are drawn; where an arrow falls short, complete it with a wave line, the arrowhead at the joint with the node; 4) fix nodes left to right to the end node.
  • Indirect method: draw the non-scaled network - compute node earliest times - position nodes by them - join as required, completing short arrows with wave lines.

Hence the invariant: node scale = the node's earliest time = max of the incoming arrows' earliest finishes; precisely because nodes sit at the maximum, shortfall arrows are completed with wave lines, so wave lines appear only at arrow ends (before nodes), never at starts - which also fixes the critical-path test below.

3. Reading rules (clause 4.4.3)

  1. Computed duration: the difference of the scale values at the end and start nodes.
  2. In an early-time network: the tail node scale is the earliest start; without a wave line the head node scale is the earliest finish; with a wave line, the right end of the solid part.
  3. Free float: the horizontal projection of the wave-line part. The commentary's derivation: the wave line's right node scale is the successor's earliest start and its start scale the activity's earliest finish, so by definition the projection is the free float.
  4. Total float: computed right to left (commentary: it is constrained by the computed duration and can be fixed only after every successor's total float).
    • For activities whose head node is the end node: per formula 4.4.3-1, Tp minus the activity's earliest finish (on the diagram, the distance from the solid line's right end to the end node's scale);
    • others per formula 4.4.3-2, recursed as TF(i-j) = FF(i-j) + min of TF(j-k) over all successors. Formulas 4.4.3-3/-4 derive from 4.3.1-10/-11, so latest times follow once floats are known.
    • Equivalent graphic method (manual): read each activity's ES and EF and its own wave-line length (0 without one); then push backwards layer by layer from the end node, finishing all successors first; for each path from the activity to the end node, sum the wave-line projections on it; the minimum such sum is the activity's total float. Activities ending at the end node follow the same logic (Tp - EF is simpler).

4. Critical path (clauses 4.5.1, 4.5.2; term 2.1.35)

  • Clause 4.5.2: in a time-scaled network, the path from start node to end node showing no wave line is the critical path; its activities are critical.
  • Clause 4.5.1: activities with the least total float are critical; a path wholly of critical activities, or of longest total duration, is critical - mark bold, double or coloured. Where only the duration or the critical path is needed, use node labelling: label each node with its earliest time (bj = ETj = max(ETi + Dij), the start node 0), double-label with value and source node(s); the computed duration is the end node's label; tracing sources backwards from the end node gives the critical path.
  • Term 2.1.35: in AOA networks the critical path is the path of critical activities or of longest total duration (in AON, additionally zero lag between critical activities).

5. One common confusion The wave-line projection = the node's earliest time - the activity's earliest finish = the earliest start of the successors at that node - the activity's earliest finish, i.e. the time lag to the successors. But since the node scale is the maximum of incoming early finishes, that lag holds only for the successor(s) starting earliest - not for every successor.

Applicable boundaries

  • Applies to early-time AOA time-scaled networks only; the code (clause 4.4.1 commentary) regulates AOA time-scaled networks only, AON time-scaled and unscaled networks compute by the formulas of clause 4.3.1.
  • The total-float formulas use Tp; with Tp equal to Tc. Where a required duration makes Tp differ from Tc, total float of end-node activities is based on Tp - not read off the drawing.
  • Wave lines are free float, not total float; using the wave length as total float is a common error.
  • The wave-free-path test holds on the drawing; after any change to the network the nodes and wave lines move - re-read and recompute.
  • Formulas 4.4.3-1/-2 are typeset graphically in the published code and are missing from the text layer; the recursions above match the commentary's derivation - verify symbols and subscripts against the printed code before issuing formal computations.

Further reading

  • JGJ/T 121-2015 clauses 4.4.1, 4.4.2 (Table 4.4.2; direct and indirect methods), 4.4.3 (formulas 4.4.3-1~-4), 4.5.1 (critical activities, node labelling, worked example), 4.5.2, term 2.1.35, clauses 4.3.1-4.3.2 (sources); first-class constructor, Construction Project Management, 1Z203030.

Keywords

Cited By