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.Higher 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 duration: A 2, B 4, C 3, D 2, all in days.
  • 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? Four things: early and late start and finish for each activity, the duration, the critical path and the float.
Céim

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

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

A project's minimum duration is set by its longest dependency path, while forward and backward passes reveal each activity's timing limits.

Why it matters

In exam scheduling questions, distinguishing parallel work from sequential work prevents inflated completion times and incorrect float calculations.

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 duration: A 2, B 4, C 3, D 2, all in days.
    • 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? Four things: early and late start and finish for each activity, the duration, the critical path and the float.
  2. Understand

    • How do I picture it?
    • Draw A, then split into B and C side by side, then join again at D. Write each duration on its activity.
    • A(2) → B(4) → D(2)
  3. Reduce

    • Where do I start?
    • At day 0, with A. Forward pass from A to D gives every ES and EF, and the duration.
    • Then the backward pass from D to A. Nothing comes after D, so its LF is the project finish.
  4. Solve

    • Forward pass: A, B, C.
    • Why forward first: an activity's earliest start depends only on what comes before it. A starts at 0; B and C start when A ends.
    • Days from the start
  5. Check

    • Is it right?
    • Path lengths
    • A–B–D: 2 + 4 + 2 = 8