PERT Problem

Analyze the same problem with probabilistic activity times given.

Activity Immediate Predecessors Most Optimistic Time Most Likely Time Most Pessimistic Time Expected Time $($ET$)$ Variance

A $236$

B A $345$

C B $124$

D B $356$

E C $345$

F D $334$

G E$,$F $123$

Step $1.$ Calculate the expected time for each activity.

Step $2.$ Identify the different paths in the network and total activity time on path.

$($Use the expected times of each activity for this calculation$).$

Path $1$: $\_\_\_\_\_\_\_\_$ Time: $\_\_\_\_\_\_\_\_\_$

Path $2$: $\_\_\_\_\_\_\_\_$ Time: $\_\_\_\_\_\_\_\_\_$

Step $3.$ Identify the critical path$($s$)$ on the network. The critical path is the one having the longest total activity times AND also has no slack.

Critical Path: $\_\_\_\_\_\_\_\_\_$ Total Time: $\_\_\_\_\_\_\_$