The Backward Pass and Float

Float is how long an activity can slip before anyone notices.

Before this Lesson

It's day 6 on the pump house job, and the supplier calls: the pump will arrive 2 days late, so installing it, activity E, will finish 2 days late too. Do you warn the owner that the 16-day finish is slipping? What if the pump were 5 days late? You could rerun the forward pass for each case. Or you could read the answer off one number in E's box, once the rest of the box is filled in.

Work back from the finish

The Forward Pass asked how early each activity can happen. Now ask the opposite: how late can each one happen without moving the finish? Hold the pump house's finish at 16 days and work backward from it.

An activity's late finish (LF) is the latest it can finish without delaying the project, and its late start (LS) is the latest it can start, its late finish minus its duration.

Start at the end. F, the 2-day test, ends the job, so it must finish by 16 and start by 14. The walls, D, and the pump, E, lead only to F, so both must be done by 14: the walls must start by 8, and the pump by 11. Now B, the foundation, which both of them wait for. Finishing B at 11 would keep the pump on time and start the walls 3 days late, so B has to meet the earlier date, 8. Every activity has to be done before any of its successors must start, so its late finish is the earliest late start among its immediate successors: a minimum, never a maximum.

LF=min⁡(LS of the immediate successors)LS=LF−duration\begin{aligned} \text{LF} &= \min(\text{LS of the immediate successors}) \\ \text{LS} &= \text{LF} - \text{duration} \end{aligned}

It's the forward pass in a mirror: there you took the latest finish coming in, and here you take the earliest start going out. The Handbook's Construction section prints both rules in its Nomenclature: "LF = Late finish = Earliest LS of successors" and "LS = Late start = LF – duration." It doesn't say where to begin. The activities that end the job get the project duration as their late finish, unless the question sets a deadline.

Running the rule box by box, from the end of the network back to its start, is the backward pass. The boxes below follow the Handbook's Activity-on-Node Annotation: early dates across the top, the duration and float under the activity, and late dates across the bottom.

0 3 A 3 0 0 3 3 8 B 5 0 3 8 3 7 C 4 4 7 11 8 14 D 6 0 8 14 8 11 E 3 3 11 14 14 16 F 2 0 14 16 Key ES EF Activity Duration TF LS LF
The pump house after both passes
Where an activity has two successors, the accented arrow leads to the one that must start first. Its late start becomes the activity's late finish.

Box layout adapted from the FE Reference Handbook, Civil Engineering: Construction, Activity-on-Node Annotation

The last two boxes finish the pass. C leads only to E, so it must finish by 11 and start by 7. A leads to B and C, which must start by 3 and 7, so A must finish by 3 and start by 0. Landing back on 0 is your check: from the project duration, at least one first activity returns to a late start of 0, and none goes below it.

Float is the room between early and late

Every box now has two starts: the earliest the activity can begin and the latest it may. The gap between them is its total float (TF), how far it can slip without delaying the project:

TF=LS−ES=LF−EF\text{TF} = \text{LS} - \text{ES} = \text{LF} - \text{EF}

The Handbook prints this in the same Nomenclature as "Float = LS – ES or LF – EF," with no "total" in front, and its box labels the slot just "Float." It's the same number.

On the pump house, C has 7 − 3 = 4 days and E has 11 − 8 = 3. A, B, D, and F have none. Those zero-float activities are the critical ones, and they make up A-B-D-F, the 16-day path that Activity Networks found by listing paths. That's no coincidence. An activity on the longest path has nothing to spare, because any slip lengthens the longest path, and the job with it.

The other activities' float comes from paths too. The only path through C, A-C-E-F, takes 12 days, while the job takes 16, so C can slip 4 days before its path catches up. Total float is how much shorter an activity's longest path is than the critical path. Hold on to that picture, because the rest of this Lesson runs on it.

Here's the full routine on the 21-day network from the forward pass Lesson.

Worked Example The backward pass and the floats
1 of 3

Time starts at 0, and the forward pass gave a project duration of 21 days. Find each activity's late dates and total float, and name the critical activities.

Activities with their early dates
ActivityDaysPredecessorsESEF
A4None04
B6A410
C3A47
D5B1015
E7B, C1017
F2C79
G4D, E, F1721

Plan versus actual: a delay against its float

Once work starts, the schedule is the plan, and every report from the field is the actual. When an activity runs late, compare its delay with its total float. If the delay is no more than the float, the finish holds. If it's more, the finish moves by the excess, the delay minus the float, not by the whole delay.

The path picture shows why. A delay to E lengthens every path through E, and the longest of them, A-B-E-F at 13 days, has 3 days of room before it reaches 16. The first 3 days of any delay fill that gap, and only what's left over pushes the finish.

So, the pump. Two days late is within E's 3 days of float, and the job still finishes at 16. Five days late uses all 3 and pushes the finish 2 days, to 18. The forward pass Lesson reran the pass to find that a 4-day delay to E costs 1 day, and the float gives 4 − 3 = 1 at a glance. Turned around, an activity can slip a given number of days without delaying the project if its total float is at least that many. All of this assumes one delay at a time. Two delays on the same path interact, as a later section shows.

Checkpoint
1 of 2

Both passes are done on this 22-day schedule. D actually finishes 8 days late. What is the new project duration?

Activities after both passes
ActivityDaysPredecessorsESEFLSLF
A4None0404
B9None09312
C8A412412
D3A47912
E6B, D9151218
F6C12181218
G5C, D12171318
H4E, F, G18221822
days

Free float: slack nobody else feels

Total float answers one question: how far can an activity slip before the project finish moves? A slip that small can still move other crews' dates, though. Free float (FF) answers a narrower question: how far can an activity slip before any successor has to start later?

FF=min⁡(ES of the immediate successors)−EF\text{FF} = \min(\text{ES of the immediate successors}) - \text{EF}

The Handbook doesn't define free float at all, so a question that asks for it supplies the definition, almost always this one. Read the question's version and use it.

On the pump house, E finishes at 11, but its one successor, F, can't start until 14 anyway, because it's waiting for the walls. So E can slip 3 days without anyone noticing: its free float is 14 − 11 = 3, the same as its total float. C is different. It finishes at 7, and its successor E can start at 8, as soon as B is done. So C has 1 free day. Slip C by 2, and the job still finishes at 16, but E can't start until 9. The pump crew notices, and E has a day less of float.

0 2 4 6 8 10 12 14 16 Days A B C D E F TF = 4 TF = 3 FF = 1 FF = 3 Finish: 16
The pump house schedule, with its float drawn in
Solid bars sit at the early dates. A dashed extension runs from each early finish to the late finish, the activity's total float, and the bracket under it marks the free float.

Free float can never exceed total float, because a slip that leaves every successor's start alone can't reach the finish either. When every successor is critical, the two are equal, as E's are. On the critical path, both are zero.

Checkpoint
1 of 2

Here's the 22-day schedule again. The question defines free float as the earliest early start among an activity's immediate successors, minus its early finish. What are the total float and free float of D?

Activities after both passes
ActivityDaysPredecessorsESEFLSLF
A4None0404
B9None09312
C8A412412
D3A47912
E6B, D9151218
F6C12181218
G5C, D12171318
H4E, F, G18221822
A.
TF = 5 days, FF = 5 days
B.
TF = 5 days, FF = 2 days
C.
TF = 8 days, FF = 2 days
D.
TF = 2 days, FF = 5 days

Counting from day 1

If the question counts from day 1, the forward pass's shortcut still works: run both passes under time 0, then add 1 to every start, early and late. Finishes and total float don't change. Free float does need care: successors start a day later on the calendar, so under day 1, FF = (earliest ES of the successors) − EF − 1. Put calendar dates into the time-0 formula, and every free float comes out a day too big.

Float belongs to the path

C shows 4 days of float and E shows 3, but that isn't 7 days of slack between them. Both sit on A-C-E-F, and that path has 16 − 12 = 4 spare days in all. Three of C's four are the same three days E shows. Use them on C, and they're gone from E.

Say C finishes 3 days late, at 10. The job still finishes at 16, since 3 days is within C's float. But E can't start until 10 now, so it finishes at 13, with only 1 day left before F needs it. Now let the pump arrive 2 days late, which was harmless this morning, and the finish moves to 17.

0 2 4 6 8 10 12 14 16 Days A B C D E F 3 days late TF = 1 TF = 1 Finish: 16
The same schedule after C finishes 3 days late
C's slip uses 3 of the 4 spare days on its path. C and E each show 1 day of float now, and it's the same day.

Float is shared along a noncritical chain: using it early in the chain leaves less for the activities after it. So adding up the floats of two activities on one chain counts the same days twice, and after any slip, the floats downstream of it are out of date.

Negative float

A question can also impose a deadline, such as a completion date in the contract. Then the backward pass starts from the deadline instead of the forward pass's duration, and everything else follows the same rules.

Give the pump house a 14-day deadline. Every late date moves 2 days earlier, so A, B, D, and F get a total float of −2, while C has 2 and E has 1. The minus sign isn't an arithmetic error. It says the plan misses the deadline by 2 days before anyone has picked up a shovel, so A-B-D-F has to gain 2 days, by shortening its activities or reworking the logic. With a deadline in play, the critical path is the one with the least float, which is 0 only when the deadline matches the forward pass.

Checkpoint
1 of 2

On a noncritical path, Q's only predecessor is P, and P's only successor is Q. The schedule shows a total float of 5 days for each. P finishes 4 days late, and then Q takes 3 days longer than planned. How many days late does the project finish?

days

Float from the paths alone

The path picture is also a shortcut. When a question asks for one activity's total float on a small network, you don't need either pass. List the paths, and subtract:

TF=T−(longest path through the activity)\text{TF} = T - (\text{longest path through the activity})

Here, TT is the project duration, the longest path of all. The one trap is which path. E sits on two: A-B-E-F at 13 days and A-C-E-F at 12. Its float is 16 − 13 = 3, matching its box. The shorter path gives 4, which is C's float, not E's. A delay to E stretches both of its paths, and the longer one reaches 16 first.

Checkpoint
A 2 B 5 C 3 D 8 E 4 F 5 G 3
An activity-on-node network, with durations in days

What is the total float of E? Try it without a backward pass.

days

Recap

  • The backward pass starts from the project duration, or a deadline the question imposes. LF is the earliest LS among the immediate successors (a minimum, never a maximum), and LS = LF − duration.
  • Total float, TF = LS − ES = LF − EF, is the Handbook's "Float." It equals T minus the longest path through the activity, and zero marks the critical activities.
  • Free float, FF = earliest ES of the successors − EF, is the slip no successor feels, and it never exceeds total float. Under day 1, subtract 1 more.
  • A delay within total float leaves the finish alone. A longer delay moves the finish by the delay minus the float.
  • Float is shared along a chain, so float used early is gone for later activities. Negative float against a deadline is the time the path must gain.