Network representations of projects

The twopass method 1 forward pass for each activity

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: predecessor Activity C: predecessor is B Activity D: no predecessor Activity E: predecessor is D Activity F: predecessor is B Computational steps: the two ­pass method 1. Forward pass: for each activity, find its earliest start time ES earliest finish time EF 2. Backward pass: for each activity, find its latest finish time 3. LF latest start time 4. LS For each activity, find its slack time S = LS – ES Identify the critical activities, where S = 0, and the critical path 1. Forward pass determine the earliest project com...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online