Critical paths and float

Critical paths and float

Spec 4.3–4 · Edexcel A-Level Further Maths: Revision notes

Studying this course? Keep your progress in one place.

Key facts

  • A forward pass takes the largest value at each event; a backward pass takes the smallest.
  • The earliest time at the finish event is the minimum project time.
  • The critical path is the longest path. Critical activities have zero float.
  • Total float F(i,j)=l(j)−e(i)−d(i,j)F(i,j)=l(j)-e(i)-d(i,j).
  • The lower bound for workers is total duration divided by project time, rounded up.

Earliest and latest times

A forward pass gives earliest times using the largest value; a backward pass gives latest times using the smallest.

The earliest event time e(j)e(j) comes from a forward pass: start with e=0e=0 at the start event and at each event take the largest value of e(i)+e(i)+ duration over the activities ending there.

The latest event time l(i)l(i) comes from a backward pass: set ll at the finish equal to its earliest time and at each event take the smallest value of l(j)−l(j)- duration over the activities leaving it.

ee at the finish event is the minimum project time.

Forward pass

Starts at:
Start event, e=0e=0
Direction:
Add durations
At each event take:
Largest value
Gives:
Earliest times

Backward pass

Starts at:
Finish event, l=el=e
Direction:
Subtract durations
At each event take:
Smallest value
Gives:
Latest times

Two activities end at an event. They give ee values of 7 and 9 in a forward pass. What is ee at the event?

Start and finish times

For an activity from event ii to event jj, use e(i)e(i) and l(j)l(j) with the duration dd.

For an activity from event ii to event jj with duration dd:

  • earliest start =e(i)=e(i)
  • earliest finish =e(i)+d=e(i)+d
  • latest finish =l(j)=l(j)
  • latest start =l(j)−d=l(j)-d.

From a precedence table, the earliest start is the largest earliest finish of its immediate predecessors, and the latest finish is the smallest latest start of the activities that follow it.

  • Earliest finishe(i)+de(i)+d
  • Latest startl(j)−dl(j)-d

Worked example

AA takes 4 days, BB takes 6, DD takes 3 (after AA and BB). When does DD start earliest?

An activity has e=5e=5 at its start event, l=14l=14 at its end event and duration 4. What is its latest start?

The critical path

The critical path is the longest path from start to finish. Its length is the minimum project time.

An activity is critical if any delay to it delays the whole project. Its earliest start equals its latest start, and its earliest finish equals its latest finish.

The critical path is a path of critical activities from start to finish. It is the longest path, and its length is the minimum project time. There can be more than one critical path.

  1. 1

    B

    6 days

  2. 2

    E

    7 days

  3. 3

    G

    2 days

  4. 4

    H

    3 days

A critical path of 18 days

Worked example

The longest path is BB, EE, GG, HH with durations 6, 7, 2 and 3 days. What is the minimum project time?

Can a project have more than one critical path?

Total float

Total float is the delay an activity can take without delaying the project: l(j)−e(i)−dl(j)-e(i)-d. Critical activities have zero float.

The total float of an activity is the amount it can be delayed, or its duration extended, without delaying the project.

For an activity from ii to jj:

F(i,j)=l(j)−e(i)−d(i,j)F(i,j)=l(j)-e(i)-d(i,j)

Critical activities have zero total float. An activity with float 2 can be delayed by up to 2 days with no effect; a longer delay delays the project by the excess, and the critical path may change.

  • Total floatl(j)−e(i)−dl(j)-e(i)-d

Worked example

Activity CC has e=4e=4 at its start event, l=11l=11 at its end event and duration 5. Find its total float.

An activity has float 2 and is delayed by 5 days. By how much is the project delayed?

Gantt charts and workers

Divide the total of all durations by the minimum project time and round up. This is only a lower bound.

A Gantt (cascade) chart shows each activity as a bar on a time axis, each needing one worker. Critical activities form a continuous line from time 0 to the project time. Other activities start at their earliest start, with spare time shown as float.

The lower bound for the number of workers needed to finish in the minimum time is the sum of all durations divided by the minimum project time, rounded up.

A schedule may need more workers.

  • Workers neededsum of durationsproject time\dfrac{\text{sum of durations}}{\text{project time}}, rounded up

Worked example

The durations total 42 days and the project takes 24 days. What is the lower bound for the number of workers?

The durations total 50 days and the project takes 20 days. What is the lower bound for workers?

Try an exam question

Activity CC runs from event 2 to event 5 and lasts 6 days. The earliest time of event 2 is 8 and the latest time of event 5 is 20. (a) Calculate the total float of CC. (b) The durations of all activities total 51 days and the minimum project time is 20 days. Find a lower bound for the number of workers.

[4 marks]

That's the notes covered.

Carry on to the next subtopic.

Try a question

What is the earliest start time of activity G?

1 mark, marked against the mark scheme

Revision notes