Critical paths and float

Critical paths and float

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

Studying this course? Keep your progress in one place.

Key facts

  • The forward pass gives earliest event times: at each event take the largest of e(i)+de(i)+d; the finish value is the minimum project duration.
  • The backward pass gives latest event times: at each event take the smallest of l(j)−dl(j)-d; the check is l(1)=0l(1)=0.
  • Total float =l(j)−e(i)−d=l(j)-e(i)-d: the delay an activity can take without delaying the project.
  • A critical activity has total float 0, and a critical path is a path of critical activities from start to finish.
  • The critical path length equals the minimum project duration, and there can be more than one critical path.

The forward pass

Work forwards from event 1 at time 0. At each later event take the largest value of e(i)+de(i)+d over the activities arriving, because all of them must be complete.

The earliest event time e(i)e(i) is the earliest time event ii can occur, so the earliest time any activity leaving it can start.

Work forwards. Set e(1)=0e(1)=0. For each later event, find e(i)+de(i)+d for every activity or dummy arriving, and take the largest.

The value at the finish event is the minimum project duration. A dummy has duration 0.

A 3B 5C 6D 2E 4F 3G 5123456
Activity network: arcs show the activity and its duration in days
  • Earliest event timee(j)=max⁡ [ e(i)+d ]e(j)=\max\,[\,e(i)+d\,]

Worked example

Using the network, find the earliest event times at events 2, 3, 4, 5 and 6.

Event 4 is reached by activities giving 9 and 7. What is e(4)?

The backward pass

Work backwards from the finish event, where l(n)=e(n)l(n)=e(n). At each earlier event take the smallest value of l(j)−dl(j)-d over the activities leaving it.

The latest event time l(j)l(j) is the latest time event jj can occur without delaying the project.

Work backwards. Set l(n)=e(n)l(n)=e(n) at the finish event. For each earlier event, find l(j)−dl(j)-d for every activity or dummy leaving it, and take the smallest, so that every leaving activity still finishes on time.

A good check is l(1)=0l(1)=0. If it is not, there is an arithmetic error.

02468101214123456EventTime (days)
  • Earliest e
  • Latest l
Earliest and latest event times for the network.

Earliest e

Event 1:
0
Event 2:
3
Event 3:
5
Event 4:
9
Event 5:
9
Event 6:
14

Latest l

Event 1:
0
Event 2:
5
Event 3:
5
Event 4:
11
Event 5:
9
Event 6:
14
Event times for the network
  • Latest event timel(i)=min⁡ [ l(j)−d ]l(i)=\min\,[\,l(j)-d\,]

Worked example

Continue the same network, with e(6)=14e(6)=14. Find the latest event times.

At an event with two leaving activities, which value do you take in the backward pass?

Start and finish times

From the event times, an activity from event ii to event jj with duration dd has four times: e(i)e(i), e(i)+de(i)+d, l(j)−dl(j)-d and l(j)l(j).

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

The difference between the latest and earliest start (or finish) is the activity's slack.

0246810Earliest startEarliest finishLatest startLatest finishTimeDays
The four times for activity D (d = 2, from event 3 to event 4).

Earliest

Start:
e(i)
Finish:
e(i) + d

Latest

Start:
l(j) − d
Finish:
l(j)
Four times for each activity

Worked example

Activity C goes from event 2 to event 4 and lasts 6 days, with e(2)=3e(2)=3 and l(4)=11l(4)=11. Find its four times.

An activity ends at an event with l(j) = 20 and lasts 8 days. What is its latest start?

Total float

Total float is how much an activity can be delayed without delaying the project, assuming all other activities start as early as possible.

The total float of an activity is the time available between its earliest start and its latest finish, minus the time it needs.

For example, F(D)=l(4)−e(3)−2=11−5−2=4F(\text{D})=l(4)-e(3)-2=11-5-2=4 days, so D can start up to 4 days late.

Total float is never negative on a valid network.

0123456Time availableDurationTotal floatQuantityDays
Activity D: time available l(4) − e(3) = 6 days, duration 2 days, so total float = 4 days.
  • Total floatF(i,j)=l(j)−e(i)−d(i,j)F(i,j)=l(j)-e(i)-d(i,j)

e(i)

A:
0
C:
3
D:
5

l(j)

A:
5
C:
11
D:
11

Duration

A:
3
C:
6
D:
2

Total float

A:
2
C:
2
D:
4
Float for three activities

An activity has e(i) = 4, l(j) = 15 and duration 7. What is its total float?

Critical activities and paths

A critical activity has total float 0, so any delay delays the project. The critical path is a path of critical activities, and its length is the minimum project duration.

An activity is critical if its total float is 0. It has no freedom.

The critical path is a path from start to finish made up of critical activities. To find it, carry out both passes, then find the activities with F=0F=0.

There can be more than one critical path. Dummies on a critical path are included.

00.511.52123456Eventl − e (days)
l − e at each event: events with 0 lie on a critical path (events 1, 3, 5 and 6).
  • Critical activitytotal float = 0
  • Critical path length= minimum project duration

Worked example

In the network above, find the critical path.

Which statement is true?

Try an exam question

The table shows the activities for a project. A: from event 1 to 2, 4 days. B: 1 to 3, 6 days. C: 2 to 4, 5 days. D: 3 to 4, 2 days. E: 4 to 5, 2 days. (a) Find the earliest and latest event times. (b) State the critical path. (c) Find the total float of activity B.

[4 marks]

That's the notes covered.

Carry on to the next subtopic.

Try a question

Carry out a forward pass. What is the earliest event time at event 4?

1 mark, marked against the mark scheme

Revision notes