Question

In: Operations Management

A network consists of the following list. Times are given in weeks. Activity Preceding Optimistic Probable...

A network consists of the following list. Times are given in weeks.

Activity

Preceding

Optimistic

Probable

Pessimistic

A

--

5

11

14

B

-

3

3

9

C

--

6

10

14

D

A, B

3

5

7

F

C

6

8

13

G

D, E

2

4

6

H

F

3

3

9

Calculate the probability that the project will be completed in less than 25 weeks.

NOTE

NO need to draw the network diagram on this page,  

It is NOT sufficient, for example, to write the “probability is = __x %.”

Show your work how you got the probability.

Solutions

Expert Solution

PROBABILITY = 24.2 %

EXPECTED TIME = (OPTIMISTIC TIME + (4 * MOST LIKELY TIME) + PESSIMISTIC TIME) / 6

VARIANCE = ((PESSIMISTIC TIME - OPTIMISTIC TIME) / 6)^2



ACTIVITY

EXPECTED TIME

VARIANCE

A

(5 + (4 * 11) + 14) / 6 = 10.5

((14 - 5) / 6)^2 = 2.25

B

(3 + (4 * 3) + 9) / 6 = 4

((9 - 3) / 6)^2 = 1

C

(6 + (4 * 10) + 14) / 6 = 10

((14 - 6) / 6)^2 = 1.7778

D

(3 + (4 * 5) + 7) / 6 = 5

((7 - 3) / 6)^2 = 0.4444

E

(6 + (4 * 8) + 13) / 6 = 8.5

((13 - 6) / 6)^2 = 1.3611

F

(2 + (4 * 4) + 6) / 6 = 4

((6 - 2) / 6)^2 = 0.4444

G

(3 + (4 * 3) + 9) / 6 = 4

((9 - 3) / 6)^2 = 1

CPM ANALYSIS


ACTIVITY

DURATION

ES

EF

LS

LF

SLACK

A

10.5

0

10.5

3

13.5

3

B

4

0

4

9.5

13.5

9.5

C

10

0

10

0

10

0

D

5

10.5

15.5

13.5

18.5

3

E

8.5

10

18.5

10

18.5

0

F

4

18.5

22.5

18.5

22.5

0

G

4

22.5

26.5

22.5

26.5

0


FORWARD PASS: ES = MAXIMUM EF OF ALL PREDECESSOR ACTIVITIES; 0 IF NO PREDECESSORS ARE PRESENT. EF = ES + DURATION OF THE ACTIVITY.

BACKWARD PASS: LF = MINIMUM LS OF ALL SUCCESSOR ACTIVITIES; COMPLETION TIME OF THE PROJECT IF NO SUCCESSORS ARE PRESENT. LS = LF - DURATION OF THE ACTIVITY.

SLACK = LF - EF, OR, LS - ES

CRITICAL PATH = PATH WITH THE LONGEST COMBINED DURATION VALUE AND 0 SLACK.

CRITICAL PATH = CEFG

DURATION OF PROJECT = 26.5

PROBABILITY

VARIANCE OF CRITICAL PATH = SIGMA(VARIANCE OF THE CRITICAL PATH) = 4.5833

STANDARD DEVIATION OF CRITICAL PATH = SQRT(VARIANCE OF CRITICAL PATH) = 2.14

EXPECTED TIME = DURATION OF THE PROJECT = CRITICAL PATH = 26.5

DUE TIME = 25

Z = (DUE TIME - EXPECTED TIME) / STANDARD DEVIATION OF CRITICAL PATH)

Z = (25 - 26.5) / 2.14 = -0.7


PROBABILITY FOR A Z VALUE OF -0.7 = NORMSDIST(-0.7) = 0.242


A Thumbs Up! would be really helpful for me. If you have any questions, please leave a comment, and I will get back to you as soon as possible.


Related Solutions

A network consists of the following list. Times are given in weeks. Activity Preceding Optimistic Probable...
A network consists of the following list. Times are given in weeks. Activity Preceding Optimistic Probable Pessimistic A -- 6 8 10 B A 1 2 4 C A 9 12 15 D A 3 4 5 E B 4 6 7 F B 14 16 22 G C, D 2 3 4 H E, G 1 2 3 I G 6 8 9 J H, I 4 6 8 K F, H, J 1 2 5 a. Draw the...
Times (days) Activity Optimistic Most Likely Pessimistic Preceding Tasks 1 8 10 13 - 2 5...
Times (days) Activity Optimistic Most Likely Pessimistic Preceding Tasks 1 8 10 13 - 2 5 6 8 - 3 13 15 21 2 4 10 12 14 1,3 5 11 20 30 4 6 4 5 8 5 7 2 3 4 5 8 4 6 10 7 9 2 3 4 8,6 Draw the AON Network Diagram Compute the expected activity time Using the expected activity times, compute the early start, early finish, late start, late finish, and...
The following information is provided about a training and development project. Activity Duration (weeks) Preceding Activities...
The following information is provided about a training and development project. Activity Duration (weeks) Preceding Activities A 3 None B 5 None C 14 A D 5 A E 4 B F 7 B G 8 D, E H 5 G, F            (a)        Draw the PDM/CPM diagram, complete with forward and backward pass information. Find the critical path. [12 marks] (b)       Assume Activity A (hire trainers) took 5 weeks. Draw the PDM/CPM diagram again.[7 marks] (c)       From which activity...
Consider the following precedence chart: ACTIVITY PRECEDING ACTIVITIES OPTIMISTIC TIME (days) MOST LIKELY TIME (days) PESSIMISTIC...
Consider the following precedence chart: ACTIVITY PRECEDING ACTIVITIES OPTIMISTIC TIME (days) MOST LIKELY TIME (days) PESSIMISTIC TIME (days) A - 5 10 15 B - 10 12 14 C - 10 10 10 D B,C 2 4 6 E A 4 8 12 F A 4 8 12 G D,E 10 12 14 I F 4 8 12 J G 2 4 6 The total slack for activity C is __________
Consider the following precedence chart: ACTIVITY PRECEDING ACTIVITIES OPTIMISTIC TIME (days) MOST LIKELY TIME (days) PESSIMISTIC...
Consider the following precedence chart: ACTIVITY PRECEDING ACTIVITIES OPTIMISTIC TIME (days) MOST LIKELY TIME (days) PESSIMISTIC TIME (days) A - 5 10 15 B - 10 12 14 C - 10 10 10 D B,C 2 4 6 E A 4 8 12 F A 4 8 12 G D,E 10 12 14 I F 4 8 12 J G 2 4 6 The total slack for activity C is __________ a. 0 b. 2 c. 8 d. 4
Consider the following precedence chart: ACTIVITY PRECEDING ACTIVITIES OPTIMISTIC TIME (days) MOST LIKELY TIME (days) PESSIMISTIC...
Consider the following precedence chart: ACTIVITY PRECEDING ACTIVITIES OPTIMISTIC TIME (days) MOST LIKELY TIME (days) PESSIMISTIC TIME (days) A - 5 10 15 B - 10 12 14 C - 10 10 10 D B,C 2 4 6 E A 4 8 12 F A 4 8 12 G D,E 10 12 14 I F 4 8 12 J G 2 4 6 The total slack for activity F is __________ a. 8 b. 4 c. 2 d. 0
Activity Optimistic Time Estimate (weeks) Most Likely Time Estimates (weeks) Pessimistic Time Estimates (weeks) Immediate Predecessor(s)...
Activity Optimistic Time Estimate (weeks) Most Likely Time Estimates (weeks) Pessimistic Time Estimates (weeks) Immediate Predecessor(s) A 3 6 9 none B 3 5 7 A C 4 7 12 A D 4 8 10 B E 5 10 16 C F 3 4 5 D, E G 3 6 8 D, E H 5 6 10 F I 5 8 11 G J 3 3 3 H, I A.)Using the information given, construct a network diagram using AON notation....
The following table provides the crash data for the project network . the normal activity times...
The following table provides the crash data for the project network . the normal activity times are considered to be deterministic and not probabilistic . Activity time(week) Activity Cost($) Activity Normal Crash Normal Crash a 9 7 $4,800 $6,300 b 11 9 $9,100 $15,500 c 7 5 $3,000 $4,000 d 10 8 $3,600 $5,000 e 1 1 $0 $0 f 5 3 $1,500 $2,000 g 6 5 $1,800 $2,000 h 3 3 $0 $0 i 1 1 $0 $0 j...
The following table represents a project with four activities. All times are in weeks. Activity Immediate...
The following table represents a project with four activities. All times are in weeks. Activity Immediate Predecessor Optimistic Time Most Likely Time Pessimistic Time A - 4 8 16 B - 7 8 9 C A 6 10 18 D B 5 13 18 A. According to the data in the table. What is the critical path? B. According to the data in the table, what is the minimum expected completion time for the project? C. According to the table...
1) Consider the network corresponding to the following information. Activity Immediate Predecessor(s) Time (Weeks) A ---...
1) Consider the network corresponding to the following information. Activity Immediate Predecessor(s) Time (Weeks) A --- 3 B --- 4 C A 6 D B 9 E B 6 F C, D 6 G D, E 8 H G, F 9 Draw the network corresponding to the above information. Using a table format, identify the critical path. What is the project completion time?
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT