Step 8 of 8 · Worked example · TEACH

← Algorithms, Optimisation & Project Scheduling

0 of 3 done

Work through the example to CHECK to open the problems.

Reach CHECK to open the problems.Ordinary Level · Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 8

Follow the worked example and explain why each modelling and calculation step is valid.

A lasts 2 days. B and C follow A and last 4 and 3 days. D takes 2 days and waits for both. Find early and late start/finish times, project duration, critical path and float.

A lasts 2 days. B and C follow A and last 4 and 3 days. D takes 2 days and waits for both B and C.

Find the early and late start and finish times, and the project duration.

Find the critical path and the float.

Read it once, slowly. Then copy it onto your page.
  • What is fixed? Four jobs, called activities, each with a length in days: A 2, B 4, C 3, D 2.
  • What is the order? B and C follow A: both need A finished. D waits for both B and C. Nothing says B waits for C.
  • What do they want? Early and late start and finish for every activity, the duration, the critical path and the float.
Céim

Ordinary Level Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 8 of 8

Project Scheduling — Critical Path, Early/Late Times & Float

A project network uses activity dependencies to find early and late times, float and the critical path that determines the shortest completion time.

Why it matters

Recognising parallel work prevents you from adding overlapping durations and helps you judge whether a delay will hold up the project.

The worked example

A lasts 2 days. B and C follow A and last 4 and 3 days. D takes 2 days and waits for both B and C. Find the early and late start and finish times, and the project duration. Find the critical path and the float.

How the worked example goes

  1. Read

    • What is fixed? Four jobs, called activities, each with a length in days: A 2, B 4, C 3, D 2.
    • What is the order? B and C follow A: both need A finished. D waits for both B and C. Nothing says B waits for C.
    • What do they want? Early and late start and finish for every activity, the duration, the critical path and the float.
  2. Understand

    • How do I picture it?
    • One circle per activity, with its days. Arrows show the order: A to B and C, then B and C to D.
    • One after another, the jobs would take 2 + 4 + 3 + 2 = 11 days. But B and C can run at the same time.
  3. Reduce

    • Where do I start?
    • At day 0, with A. Go forward, A to D: that gives every ES and EF, and the duration.
    • Then go back, D to A. Nothing comes after D, so its LF is the project's end.
  4. Solve

    • Forward pass: A, B, C.
    • Days from the start
    • A: ES = 0, EF = 0 + 2 = 2
  5. Check

    • Is it right, and did I answer it?
    • Paths: A–B–D = 2 + 4 + 2 = 8, A–C–D = 2 + 3 + 2 = 7. The longest, 8, is the duration, on A–B–D. 8 − 7 = 1 is C's float. ✓
    • Start C 1 day late, at day 3: it ends at 6, when D starts anyway. 2 days late ends at 7 and delays D. ✓