Problem:
|
Job Number
|
Predecessor Jobs
|
a
|
m
|
b
|
|
1
|
-
|
2
|
3
|
4
|
|
2
|
1
|
1
|
2
|
3
|
|
3
|
1
|
4
|
5
|
12
|
|
4
|
1
|
3
|
4
|
11
|
|
5
|
2
|
1
|
3
|
5
|
|
6
|
3
|
1
|
2
|
3
|
|
7
|
4
|
1
|
8
|
9
|
|
8
|
5,6
|
2
|
4
|
6
|
|
9
|
8
|
2
|
4
|
12
|
|
10
|
7
|
3
|
4
|
5
|
|
11
|
9,10
|
5
|
7
|
8
|
Required:
Question 1) Construct the appropriate network diagram
Question 2) Indicate the critical path
Question 3) What is the expected completion time for the project?
Question 4) You can accomplish any one of the following at an additional cost of $1,500
(1) Reduce Job 5 by two days
Reduce Job 3 by two days
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?
Solve the given numerical problem and illustrate step by step calculation.