Explore BrainMass
Share

# Project Management - Critical Path

Given the following data, find the critical path and the minimum project completion time.

Activity; te(expected activity time); Preceding Activity

1-2; 3; -
2-4; 8; 1-2
2-3; 6; 1-2
2-5; 2; 1-2
4-6; 13; 2-4, 2-3
3-5; 11; 2-3
5-6; 8; 2-5, 3-5
6-7; 6; 4-6, 5-6

#### Solution Preview

Given the following data, find the critical path and the minimum project completion time.

Activity; te(expected activity time); Preceding Activity

1-2; 3; -
2-4; 8; 1-2
2-3; 6; 1-2
2-5; 2; 1-2
4-6; 13; 2-4, 2-3
3-5; 11; 2-3
5-6; 8; 2-5, 3-5
6-7; 6; 4-6, 5-6

Determine ES, EF, LS, LF, and slack for each activity.

1. Earliest start time (ES): the earliest time an activity can begin without violation of immediate
predecessor requirements
2. Earliest finish time (EF): the earliest time at which an activity can end
3. Latest start time (LS): the latest time an activity can begin without delaying the entire project
4. Latest finish time (LF): the latest time an activity ...

#### Solution Summary

This solution is comprised of a detailed explanation to find the critical path and the minimum project completion time.

\$2.19