Finding the Critical Path: A General B Scheduling Problem, Worked Step by Step
A construction activity diagram tells you which work depends on other work. To calculate when the project can finish, you also need durations and scheduling assumptions. A page of boxes and arrows alone does not establish the critical path.
That distinction matters when studying General B planning and estimating. You can recognize the order of construction and still make the wrong scheduling decision if you add every task duration, count arrows, or assume the longest individual task always controls completion.
The following is an original teaching network inspired by the activity-network concept in Peerless's General B material. Its durations are invented for calculation, not estimates for an actual building.
Start with seven activities and explicit dependencies
Assume one working-day calendar, finish-to-start links, no lags, no imposed finish date, and enough separate resources for the parallel activities. “Day 0” is the start; a two-day activity beginning then finishes at elapsed day 2. Treat required waiting, approvals, and inspections as included in the stated scopes for this exercise.
| ID | Activity | Duration | Must wait for |
|---|---|---|---|
| A | Site setup | 2 days | Start |
| B | Foundation sequence | 4 days | A |
| C | Fabricate and deliver framing package | 7 days | A |
| D | Framing | 5 days | B and C |
| E | Roof work | 3 days | D |
| F | Rough-in work | 6 days | D |
| G | Final checks for this phase and release | 2 days | E and F |
Read each “and” carefully. D cannot start when just the foundation is ready; it needs the framing package too. G cannot start when just the roof work is done; the rough-in branch must also finish.
This network models only the listed phase. A real schedule must separately account for the actual scope, sequencing, curing or waiting periods, inspection availability, and resources.
The forward pass: wait for the later predecessor
A finishes at day 2. B can then run from 2 to 6, while C runs from 2 to 9. Because D needs both, its earliest start is day 9. Adding B's four days to C's seven would wrongly treat parallel work as sequential.
D finishes at 14. E can run from 14 to 17 and F from 14 to 20. G must wait until 20, then finishes at 22 working days.
| Activity | Early start | Early finish |
|---|---|---|
| A | 0 | 2 |
| B | 2 | 6 |
| C | 2 | 9 |
| D | 9 | 14 |
| E | 14 | 17 |
| F | 14 | 20 |
| G | 20 | 22 |
The controlling sequence is A → C → D → F → G: 2 + 7 + 5 + 6 + 2 = 22.
Adding all seven durations gives 29 days, which incorrectly assumes every activity happens one after another. Choosing the route with the most boxes is also unreliable: the elapsed time along a route is what matters.
The backward pass: how late can an activity start?
Work backward from the calculated day-22 finish. G must start by 20. E must therefore finish by 20 and can start as late as 17. F, also feeding G, must finish by 20 and start by 14.
D feeds both E and F. It must meet the earlier of their latest starts, so it must finish by 14 and start by 9. B and C must both finish by 9. B can start at 5; C must start at 2.
| Activity | Early start | Late start | Total float |
|---|---|---|---|
| A | 0 | 0 | 0 |
| B | 2 | 5 | 3 days |
| C | 2 | 2 | 0 |
| D | 9 | 9 | 0 |
| E | 14 | 17 | 3 days |
| F | 14 | 14 | 0 |
| G | 20 | 20 | 0 |
Here, total float is late start minus early start. B has three days because its early finish at 6 sits three days ahead of D's controlling start at 9. E has three days because F holds G until 20.
The GAO Schedule Assessment Guide explains the relationship between network logic, forward and backward passes, and float. Our zero-float result applies to this simplified network. Real schedules with constraints, different calendars, or resource limits need more careful interpretation.
What a five-day foundation delay really does
Suppose B takes nine days instead of four, with everything else unchanged. B now finishes at 11. C still finishes at 9, so D starts at 11 instead of 9.
The phase finishes at 24, two days later than planned. The five extra days first consume B's three days of float; the remaining two extend the finish. The controlling path switches to A → B → D → F → G.
Compare a two-day increase in E. E would finish at 19, still before F at 20. The project finish remains 22. That does not make roof work unimportant; it means this particular change fits inside the current schedule allowance.
Float is a shared allowance on a path
Imagine replacing B's four-day activity with two sequential two-day activities. Each could show three days of total float. That does not create six spare days. If the first consumes two days and the second consumes another two, the branch uses four days against a three-day allowance.
Float also says nothing, by itself, about who is contractually entitled to use it. Scheduling arithmetic and contract rights are different questions.
The same caution applies to “making up time.” If C is shortened from seven days to three, B becomes the slower predecessor at four days. Completion improves from 22 to 19, not 18. The fourth day saved on C no longer advances D because the foundation branch is now controlling.
Check the decision, not just the sum
Original practice problem: Using the original network, B takes two additional days. No other duration or dependency changes. What is the new phase finish?
- 20 days
- 22 days
- 24 days
- 29 days
Answer: B, 22 days. B now finishes at day 8; C still finishes at 9. D's start does not move. Adding the two-day delay directly to the project finish ignores the three days of float.
When you review a schedule problem, identify the dependencies, calculate the merge points, and then test what the proposed change actually delays. Recalculate after the change; the old critical path may no longer control.
For more planning and estimating concepts, pair the Peerless General B Study Guide with the General B practice exam. These worked scenarios are original exercises, not live CSLB questions.
Source and scope
Peerless General B study material, printed page 32, construction activity network; GAO-16-89G, Schedule Assessment Guide, printed pages 30–31, 75–78, and 91–93. The activity labels, durations, tables, and delay cases above are newly constructed teaching examples.