Critical Paths

Key ideas

• Interpret precedence tables and draw networks from them

• Use dummy activities to represent complex precedence tables accurately

• Make a forward and backward pass of a network to find the earliest and latest start times for activities

• Find the most efficient sequence of activities within a project to minimise the total duration

• Calculate total and free float time of non-critical activities

• Schedule activities in a Gantt chart