Compute earliest start-earliest finish and latest start


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

Activity Immediate Predecessor Optimistic Time Most Likely Time Pessimistic 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

a. Draw the network diagram.

b. Compute the expected time and variances for each activity.

c. Compute the earliest start, earliest finish, latest start, latest finish, and slack for each activity (based on expected times).

d. What is the critical path?

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

Request for Solution File

Ask an Expert for Answer!!
Operation Management: Compute earliest start-earliest finish and latest start
Reference No:- TGS080622

Expected delivery within 24 Hours