Share
Explore BrainMass

PERT/CPM with optimistic, most likely, and pessimistic times

A project has the following activities, precedence relationships, and time estimates in days:

Activity Predecessor Optimistic Most likely Pessimistic
Activities Time Time Time
A -- 6 7 8
B A 4 4 4
C A 5 6 8
D B 8 10 10
E B 7 10 15
F C 9 9 13
G C 7 7 7
H D 4 6 8
I E, F 6 9 11
J G 8 9 10
K H, I, J 3 5 6

Compute the earliest start, earliest finish, latest start, latest finish, and slack for each activity

What are the critical path and duration of the project?

What is the probability that the project will take longer than 38 days?

Solution Preview

The Critical Path is when the Slack Time is zero. This means that activities with 0 slack time should never be ...

Solution Summary

This solution computes for a PERT/CPM problem with optimistic time, most likely time, and pessimistic time. Computation and network is in the attached file.

$2.19