Calculate a six-activity critical path from start to finish, with early and late dates, total and free float, changed durations and resource-constrained scenarios.
The workbook uses elapsed working-time offsets and states the network assumptions explicitly. It includes three calculation tables and independent arithmetic checks for the original network and its altered scenarios.
The question this network answers
Calculate the earliest finish implied by a stated activity model. Use clear work boundaries and one consistent time unit. A joining activity waits for all required predecessors. Consistent notation avoids inclusive-date counting errors.
ES is early start, EF early finish, LS late start and LF late finish. EF = ES + duration; LS = LF – duration in this convention.
Forward pass: A, B and C
Work from the beginning using the latest required predecessor finish. Use the maximum predecessor EF at each finish-to-start join. The final activity must wait for both required branches. A compact table lets you check the whole forward pass.
For each finish-to-start relationship, the successor’s start must be at or after the predecessor’s finish. At a join, use all the required predecessors.
Compare the path durations
The longest complete path controls the earliest finish in this logic model. Set the finish boundary, then work from the end toward the beginning. Use the minimum successor LS at a branching point. Put the forward and backward passes together before calculating float.
Each activity’s LF minus LS equals its duration. The backward calculation respects the earliest required successor starts and the chosen finish boundary.
Calculate total float
Total float expresses flexibility relative to the relevant finish boundary. Free float concerns the next activity’s early start rather than only project finish. Use dates, float and path totals as cross-checks. Use the joins to test what the float actually means.
If C starts at 4, it finishes at 7. E then runs 7-11, and F can still run 11-13 because D also finishes at 11.
Increase E’s duration
A noncritical branch can become controlling when it consumes its flexibility. A dependency network does not automatically solve resource availability. Compression must affect work that controls the relevant finish. Working-time arithmetic needs an actual calendar to become a date promise.
Thirteen working days span more than thirteen calendar days when weekends are nonworking. A resource or activity calendar can create further differences.
Update at a status date
Forecast from actual evidence and the remaining work. Use the summary to verify a fresh calculation of the original network.
Every early and late date must match its duration and dependency logic. C’s free float is 1 even though its total float is 2.
Contents
- The question this network answers
- List the activities and durations
- Set the predecessor logic
- Use elapsed-time offsets
- Forward pass: A, B and C
- Forward pass: D and E
- Forward pass: F and finish
- The early-date table
- Compare the path durations
- Start the backward pass
- Backward pass: B, C and A
- The late-date table
- Calculate total float
- Calculate free float
- Confirm the critical path
- Delay C by one or two days
- Increase E’s duration
- Test a shared-resource conflict
- Try a twelve-day target
- Translate offsets to dates
- Update at a status date
- Your complete answer check
Using the PDF
Each numbered page contains an explanation, an original worked situation and a practical action. The bookmarks navigate the learning pages. A templates advertisement follows content page 5 and a Coursera Plus advertisement follows content page 15. The entire advertisement image is linked. Promotional links may earn Coursya a commission. A purchase is optional.
Frequently asked questions
Who is this guide for?
Calculate a six-activity critical path from start to finish, with early and late dates, total and free float, changed durations and resource-constrained scenarios.
How can I practise the ideas?
Follow the running case, work through the page actions and use the PDF bookmarks to revisit a topic. The final learning pages help you apply the decisions to your own project.
What does the download contain?
The PDF contains 25 pages, including 22 numbered learning pages, a cover and two linked advertisements. The book is written in English.


