A project consists of 7 Jobs. Jobs A and F can be started and completed independently. Jobs B and C can start only after job A has been completed. Jobs D E and G can start only after jobs B, (C and D) and (E and F) are completed, respectively. Time estimates of all the jobs are given in the following table:
|
|
Time Estimates (Days)
|
|
Job
|
Optimistic
|
Pessimistic
|
Most Likely
|
|
A
|
3
|
7
|
5
|
|
B
|
7
|
11
|
9
|
|
C
|
4
|
18
|
14
|
|
D
|
4
|
12
|
8
|
|
E
|
4
|
8
|
6
|
|
F
|
5
|
19
|
12
|
|
G
|
2
|
6
|
4
|
Draw the network and determine the critical path, and its expected duration (Te). What is the probability of completing the project in Te days? Also, determine the total & free slacks of all the jobs.