Step 6

Forward and backward passes

• Add the durations along each path in your network

  • And hence establish the earliest start (ES) and finish (EF) dates for each activity
  • This is known as the "Forward Pass"
• Repeat this operation but working backwards from the last date established in the Forward Pass

  • Or from a specified "Required Completion" date
  • And hence establish the latest start (LS) and finish (LF) dates for each activity
  • This is known as the "Backward Pass"

Previous slide

Next slide

Back to first slide

View graphic version