PERT Problem

$A$ alyze the same problem with probabilistic activity times given.

$\backslash$table$[[$Activity$,\backslash$table$[[$Immediate$],[$Predecessors$]],\backslash$table$[[$Most$],[$Optimistic$],[$Time$]],\backslash$table$[[$Most$],[$Likely$],[$Time$]],\backslash$table$[[$Most$],[$Pessimistic$],[$Time$]],\backslash$table$[[$Expected$],[$Time$],[($ET$)]],$Variance$],[$A$,-,2,3,6,,],[$B$,$A$,3,4,5,,],[$C$,$B$,1,2,4,,],[$D$,$B$,3,5,6,,],[$E$,$C$,3,4,5,,],[$F$,$D$,3,3,4,,],[$G$,$E$,$F$,1,2,3,,]]$

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: