Question: SCHEDULING PROBLEM: WITH ALL m ACTIVITY PREDECESSOR (in days) (in Days) (in Days) A 1 4 7 B 2 2 2 2 5 8 A

SCHEDULING PROBLEM: WITH ALL m ACTIVITYSCHEDULING PROBLEM: WITH ALL m ACTIVITY

SCHEDULING PROBLEM: WITH ALL m ACTIVITY PREDECESSOR (in days) (in Days) (in Days) A 1 4 7 B 2 2 2 2 5 8 A D 3 5 5 A E 4 6 8 C,B 0 F 0 6 , G 3 6 9 DE FIND: 1. The Critical path, and expected completion time 2. The variance and slack 3. Probability that the project will be done in 23 days 4. Completion time corresponding to 95% probability (0.95) Activity Predecessors TE Slack (Optimistic) (Most Likely) b (Pessimistic) (Expected Time) Sigma squared o2 (LS-ES) TE=[a+4m+b)/6 A 1 4 7 1 (1+(4*4)+7]/64 B 2 2 2 0 C A 2 5 8 1 D A 3 4 5 0.11 E CB 4 6 8 0.44 F CB 0 0 6 1 G D, E 3 6 9 1

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!