Share
Explore BrainMass

Critical Path

In the attached problem I need to draw a decision tree and fill in the table. I also need to find the critical path and duration and slack.

See attached file for full problem description.

Activity Predecessor Duration Earliest Start Earliest Finish Late Start Late Finish Slack
A n/a 7
B n/a 5
C A 3
D B 5
E C 4
F C, D 4
G E, F 3
H G 1

Fill in the table, find the critical path and duration.

Attachments

Solution Preview

Activity Predecessor Duration Earliest Start Earliest Finish Late Start Late Finish Slack
A n/a 7
B n/a 5
C A 3
D B 5
E C 4
F C, D 4
G E, F 3
H G 1

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 can end without delaying the entire project

We begin at network's origin to compute the ...

Solution Summary

This solution is comprised of a detailed explanation to find the critical path of this problem.

$2.19