Question

Use the table below to answer the questions 25 to 28. Activity Optimistic duration Pessimistic duration...

Use the table below to answer the questions 25 to 28.

Activity

Optimistic duration

Pessimistic duration

Most Likely duration

Weighted duration

Immediate Predecessor

P

15

27

21

-

Q

18

36

24

P

R

26

40

24

P

S

21

39

27

Q

T

27

33

24

Q,R

U

16

32

24

S,T

V

16

30

26

U

Calculate the actual duration of each activity (fill-in the table)

Draw an AOA network diagram for the activities (in the space below):

State the minimum duration of the project. ……………………………………………….

State the ES and LS time of activity T …………………………………………………….

Homework Answers

Answer #1

The AOA network diagram is as below:-

The duration of different activities are as below:-

Activity

Optimistic

Most Probable

Pessimistic

Expected completion time

Expected completion time

P

15

27

21

(15+4*27+21)/6

24.00

Q

18

36

24

(18+4*36+24)/6

31.00

R

26

40

24

(26+4*40+24)/6

35.00

S

21

39

27

(21+4*39+27)/6

34.00

T

27

33

24

(27+4*33+24)/6

30.50

U

16

32

24

(16+4*32+24)/6

28.00

V

16

30

26

(16+4*30+26)/6

27.00

Formula for Expected completion time = (O+4M+P)/6

ES of activity T= 59 (from the diagram)

LS of activity T=59 (from the diagram)

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Use the table below to answer the questions Activity Optimistic duration Pessimistic duration Most Likely duration...
Use the table below to answer the questions Activity Optimistic duration Pessimistic duration Most Likely duration Weighted duration Immediate Predecessor P 15 27 21 - Q 18 36 24 P R 26 40 24 P S 21 39 27 Q T 27 33 24 Q,R U 16 32 24 S,T V 16 30 26 U 1. Calculate the actual duration of each activity (fill-in the table) 2. Draw an AOA network diagram for the activities (in the space below): 3....
Consider the network described in the table below. Activity Immediate Predecessor(s) Pessimistic Probable Optimistic J --...
Consider the network described in the table below. Activity Immediate Predecessor(s) Pessimistic Probable Optimistic J -- 15 10 8 K -- 9 8 7 L J 10 6 5 M J 3 3 3 N K,M 9 5 1 O K,M 10 7 4 P L,N 10 8 3 a. Calculate the expected duration of each activity. b. Calculate the expected duration and variance of the critical path. c. Calculate the probability that the project will be completed in fewer...
Activity Depends on Optimistic Duration (Days) Most Likely Duration (days) Pessimistic Duration (Days) A - 7...
Activity Depends on Optimistic Duration (Days) Most Likely Duration (days) Pessimistic Duration (Days) A - 7 10 18 B A 3 8 14 C B 10 14 22 D A 2 5 9 E B,D 7 9 15 F C,D 4 9 19 G B 10 15 29 H C,E,F 2 8 19 I G,H 1 2 7 J I 3 9 18 Refer to the information above: Determine the following for each activity: Expected Duration (round to the nearest...
Refer to the information below: Depends On Optimistic Duration(days) Most Likely Duration(days) Pessimistic Duration(days) A -...
Refer to the information below: Depends On Optimistic Duration(days) Most Likely Duration(days) Pessimistic Duration(days) A - 7 10 18 B A 3 8 14 C B 10 14 22 D A 2 5 9 E B,D 7 9 15 F C,D 4 9 19 G B 10 15 29 H C,E,F 2 8 19 I G,H 1 2 7 J I 3 9 18 Determine the following for each activity: Expected Duration (round to the nearest whole number) Early Start...
Activity Immediate Predecessor Optimistic Time Most-likely time Pessimistic Time A None 3 6 9 B A...
Activity Immediate Predecessor Optimistic Time Most-likely time Pessimistic Time A None 3 6 9 B A 3 5 7 C A 4 7 12 D B 4 8 10 E C 5 10 16 F D, E 3 4 5 G D, E 3 6 8 H F 5 6 10 I G 5 8 11 J H, I 3 3 3 (a). What is the expected time for each activity? (2 points) (b.) What is the variance for each...
In the following table task durations are given in weeks. Use the three point to find:...
In the following table task durations are given in weeks. Use the three point to find: Activity Predecessor Optimistic Normal Pessimistic A None 2 4 6 B None 3 5 9 C A 4 5 7 D A 4 6 10 E B,C 4 5 7 F D 3 4 8 G E 3 5 8 Construct the (AON) Activity on Node network diagram Find each activity’s ES, EF, LS and LS Identify all paths. Which path is the critical...
Use the following table to answer the following question Activity Immediate Predecessor Time ES EF LS...
Use the following table to answer the following question Activity Immediate Predecessor Time ES EF LS LF A - 4 0 4 6 10 B - 5 0 5 0 5 C A 3 4 7 10 13 D B 8 5 13 5 13 E B 2 5 7 16 18 F C, D 3 13 16 15 18 G C, D 7 13 20 13 20 H E, F 2 16 18 18 20 How long can activity...
Draw the Activity-on-Arrow (AoA) and Activity-on-Node (AoN) networks using the activity dependency table given below and...
Draw the Activity-on-Arrow (AoA) and Activity-on-Node (AoN) networks using the activity dependency table given below and find the critical path(s) Activities Predecessor duration A - 2 B - 10 C A 9 D A,B 7 E A,B 9 F B 5 G C 10 H D,E 1 I D,E,F 2 J F 7 K C,H,I 2 L I,J 2 M I 1 N G,K 5
A partially solved PERT problem is detailed in the table below. Times are given in weeks....
A partially solved PERT problem is detailed in the table below. Times are given in weeks. Activity Immediate Predecessor(s) Optimistic Most Likely Pessimistic A -- 8 10 15 B -- 7 8 9 C A 5 6 10 D A 3 3 3 E B,D 1 5 9 F B,D 4 7 10 G C 3 8 10 H E 5 7 9 I E 4 5 8 J F 2 5 8 K H, I 1 3 6 a)...
1. Given is a PERT project network diagram as shown below: Activity Start A B C...
1. Given is a PERT project network diagram as shown below: Activity Start A B C D E F G H I J K End Time 0 18 24 21 38 28 34 22 20 34 34 16 0    a) The Project Completion time =   b) The Earliest Start time, ES, of Activity F =   c) The Earliest Start time, ES, of Activity K =   d) The Latest Start time, LS, of Activity E =   e) The non-critical activities...