I only need help with D and E please thank you so much (a) From the given inform

ID: 424018 • Letter: I

Question

I only need help with D and E please thank you so much

(a) From the given information, network diagram can be drawn as below:

(b) Expected time of each job is calculated as;

Expected time, T = (a + 4m + b) / 6

Expected time for job 1 = [2 + (4 x 3) + 4] / 6 = 3

Expected time for job 2 = [1 + (4 x 2) + 3] / 6 = 2

Expected time for job 3 = [4 + (4 x 5) + 12] / 6 = 6

Expected time for job 4 = [3 + (4 x 4) + 11] / 6 = 5

Expected time for job 5 = [1 + (4 x 3) + 5] / 6 = 3

Expected time for job 6 = [1 + (4 x 2) + 3] / 6 = 2

Expected time for job 7 = [1 + (4 x 8) + 9] / 6 = 7

Expected time for job 8 = [2 + (4 x 4) + 6] / 6 = 4

Expected time for job 9 = [2 + (4 x 4) + 12] / 6 = 5

Expected time for job 10 = [3 + (4 x 4) + 5] / 6 = 4

Expected time for job 11 = [5 + (4 x 7) + 8] / 6 = 6.83

In order to determine the critical path, let us calculate the total time taken to reach Start to End through all the possible paths.

1 - 2 - 5 - 8 - 9 - 11 = 3 + 2 + 3 + 4 + 5 + 6.83 = 23.83

1 - 3 - 6 - 8 - 9 - 11 = 3 + 6 + 2 + 4 + 5 + 6.83 = 26.83 (Critical path)

1 - 4 - 7 - 10 - 11 = 3 + 5 + 7 + 4 + 6.83 = 25.83

The lengthiest path is the critical path. Here, the path (1 - 3 - 6 - 8 - 9 - 11) is the lengthiest of all the paths and hence, it is the critical path of the project.

Critical path = 1 - 3 - 6 - 8 - 9 – 11

d. You can accomplish any one of the following at an additional cost of $1,500

(1) Reduce Job 5 by two days

(2) Reduce Job 3 by two days

(3) Reduce Job 7 by two days

If you will save $1,000 for each day that the earliest completion time is reduced, which action, if any, would you choose and why?

e. What is the probability that the project will be completed in 30 days?

3.a Times (Days) Job Number Predecessor Jobsa 512 4 11 5.6 12 10 g,10 a. b. Construct the appropriate network diagram Indicate the critical path

Explanation / Answer