Step 8 of 8 · Worked example · TEACH
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 8Follow 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.
Ordinary Level Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 8 of 8
A project network uses activity dependencies to find early and late times, float and the critical path that determines the shortest completion time.
Recognising parallel work prevents you from adding overlapping durations and helps you judge whether a delay will hold up the project.
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.