Critical path analysis
Represent and analyse projects as activity networks; perform forward and backward scans to find earliest and latest start times; identify the critical path and minimum project completion time.
Networks · MS-N3
Sub-topics
Activity networks
Represent a project as an activity network (activity-on-node) from a precedence table; identify immediate predecessors and successors; recognise when a dummy activity is required.
Forward and backward scanning
Apply forward scanning to find earliest start times (EST) and backward scanning to find latest start times (LST); calculate float (slack) time for each activity.
The critical path
Identify the critical path as the longest path through the activity network; determine the minimum project completion time; interpret the effect of delays to critical and non-critical activities.