Question

In: Operations Management

Use the project description presented in the table below for the following questions: Activity Immediate Predecessor...

Use the project description presented in the table below for the following questions: Activity Immediate Predecessor Optimistic Time (O.T.) Most likely Time (M.T.) Pessimistic Time (P.T.) A None 4 6 9 B A 3 5 7 C A 4 7 12 D B 4 8 10 E C 5 9 15 F D 4 4 5 G D, E 3 6 8 H F 5 6 10 I G 5 8 11 J H, I 5 5 5 Calculate the expected time for each activity (2 points) Calculate the variance for each activity (2 points) Using the information given, construct a network diagram (2 points) Use both the longest path method and ES/EF; LS/LF method on the diagram for the following questions and show your answers in the table below. What is the expected project completion time? (3 points) What are the critical activities? (3 points) What are the slack values for non-critical activities? (4 points) The Longest Path Method ES/EF/LS/LF Expected project finish time Critical activities A,B,D,E,G,I,J Non-critical activities (slack values) C,F,H Calculate the probability that the project will be completed in 40 weeks. (2 points) Calculate the probability

that the project will be completed in 43 weeks.

PLEASE DO NOT ROUND ANWSERS

Solutions

Expert Solution

Expected time, Te = (Pessimistic time + 4*Most likely time + Optimistic time)/ 6

Variance = ((Optimistic time - Pessimistic time)/ 6)2


Te and variance is calculated below.

Activity Immediate Predecessor OT MT PT Expected time,Te Variance, σ2
A None 4 6 9 (4+4*6+9)/6=6.167 ((9-4)/6)^2=0.694
B A 3 5 7 5.000 0.444
C A 4 7 12 7.333 1.778
D B 4 8 10 7.667 1.000
E C 5 9 15 9.333 2.778
F D 4 4 5 4.167 0.028
G D,E 3 6 8 5.833 0.694
H F 5 6 10 6.500 0.694
I G 5 8 11 8.000 1.000
J H,I 5 5 5 5.000 0.000

Network diagram basis these details is drawn as below:

Longest path method:

To find the critical path, we will assess all possible paths and path with longest completion time will be critical path.

Possible paths are-

  • A-B-D-F-H-J: 6.167+5+7.667+4.167+6.5+5= 34.501
  • A-B-D-G-I-J: 37.667
  • A-C-E-G-I-J: 41.667

Hence, path A-C-E-G-I-J with longest time of 41.667 is the critical path. Critical activities are A,C,E, G, I, J. Expected project completion time is same as critical path expected time of 41.667.

ES/ EF; LS/ LF method:

Earliest Start Time (ES) = the earliest time that an activity can begin

Earliest Finish Time (EF) = the earliest time that an activity can be completed

EF = ES + duration of activity        

Latest Start Time (LS) = the latest time that an activity can begin without lengthening the minimum project duration

Latest Finish Time (LF) = the earliest time than an activity can be completed without lengthening the minimum project duration

LF = LS + duration of activity   

Duration of the project = the difference between the maximum value of the "latest finish time" of projects and the minimum value of the "earliest start time" of projects

Project duration = max(LF) - min(ES)     

Slack = the amount of time that a project can be delayed without increasing the duration of the project

Slack = LF- LS or EF - ES

Critical path is the path with Total Slack = 0

Below is the updated table with the output:

Activity Immediate Predecessor Expected time,Te Variance, σ2 Early Start (ES) Early Finish (EF) Late Start (LS) Late Finish(LF) Slack Critical Path
A None 6.167 0.694 0 6.167 0.000 6.167 0.000 Y
B A 5.000 0.444 6.167 11.167 10.167 15.167 4.000
C A 7.333 1.778 6.167 13.500 6.167 13.500 0.000 Y
D B 7.667 1.000 11.167 18.834 15.167 22.834 4.000
E C 9.333 2.778 13.500 22.834 13.500 22.834 0.000 Y
F D 4.167 0.028 18.834 23.000 26.000 30.167 7.167
G D,E 5.833 0.694 22.834 28.667 22.834 28.667 0.000 Y
H F 6.500 0.694 23.000 29.500 30.167 36.667 7.167
I G 8.000 1.000 28.667 36.667 28.667 36.667 0.000 Y
J H,I 5.000 0.000 36.667 41.667 36.667 41.667 0.000 Y

Clearly, critical path with slack = 0 are A-C-E-G-I-J. Total expected time is 41.667.

Total variance of critical activities are 0.694+1.778+2.778+0.694+1+0= 6.944

Non critical activities with slack are- B(4), D(4), F (7.167), H (7.167).

Probability of project to be completed in 40 weeks- We will calculated z-statistics and use z table to find probability

Variance for critical path =σ2 = 6.944. Hence, standard deviation =σ= 2.635

Mean expected time for critical path, µ = 41.667

X= 40

Calculating z-score,

z = (X-µ / σ) = (40 - 41.667)/ 2.635 = -0.63

(Looking at z-table given below, to find the probability. Under negative z value, look for row -0.6 and column 0.03 we will get probability value of 0.2643)

P(Z<-0.63) = 0.2643 or 26.43%

Hence, Probability of completing project within 40 weeks is 26.43%

Probability of completing project in 43 weeks, P(X<43),

z = (43 - 41.667)/ 2.635 =0.51

(looking at ztable, corresponding probability value is 0.6950)

P(Z<0.51) = 0.6950 or 69.50%

Hence, Probability of completing project in 43 weeks is 69.50%

Please give thumbs up/ likes if you find this answer helpful. Thank you!


Related Solutions

Activities, predecessors and duration for a School Building Project Activity Description Immediate predecessor Duration (days) A...
Activities, predecessors and duration for a School Building Project Activity Description Immediate predecessor Duration (days) A Clear Site and mobilize labour and equipment None 5 B Excavate foundation A 15 C Procure materials (sand, cement, chippings etc.) A 10 D Pour foundation concrete B, C 5 E Mould sandcrete blocks (substructure) C 5 F Construct substructure block work D, E 15 G Construct superstructure block work F, H 30 H Make doors and window frames I 10 I Procure and...
Information on a project’s activities is shown in the following table: Activity Immediate Predecessor Activity Time...
Information on a project’s activities is shown in the following table: Activity Immediate Predecessor Activity Time (wks) Total Budgeted Cost A - 4 24,000 B - 3 27,000 C B 2 14,000 D A 8 32,000 E D 3 24,000 F C, E 4 60,000 G D 6 30,000 H F 6 30,000 I G 4 20,000 J G, H 3 18,000 K I 2 10,000 L J 4 16,000 Create a Gantt chart based on earliest start times. (20...
The following activities are part of a project to be scheduled using CPM: ACTIVITY IMMEDIATE PREDECESSOR...
The following activities are part of a project to be scheduled using CPM: ACTIVITY IMMEDIATE PREDECESSOR TIME (WEEKS) A — 7 B A 6 C A 2 D C 4 E B, D 3 F D 4 G E F 6 a. Draw the network (20 points) b. What is the critical path? c. How many weeks will it take to complete the project ? d. Identify the early start, early finish, late start, and late finish for each activity...
Suppose there are 8 activities in your project with the following information. Activity Immediate Predecessor Processing...
Suppose there are 8 activities in your project with the following information. Activity Immediate Predecessor Processing Time (days) Processing Cost ($ per day) A B 5 20 B - 4 40 C A,B 6 30 D A 7 10 E C,D 6 25 F C 5 40 G E,F 4 25 H F 3 50 What is the total project lead time? a.) 40 b.)26 c.) 23 What activity is not part of the critical path? a.) activity E b.)...
Time​ (days) Immediate Time​ (days) Immediate Activity a m b ​Predecessor(s) Activity a m b ​Predecessor(s)...
Time​ (days) Immediate Time​ (days) Immediate Activity a m b ​Predecessor(s) Activity a m b ​Predecessor(s) A 55 55 77 long dash— H 44 44 66 ​E, F B 11 22 55 long dash— I 22 77 1010 ​G, H C 55 55 55 A J 22 44 77 I D 44 88 1313 A K 66 1010 1313 I E 11 1010 1717 ​B, C L 22 66 66 J F 11 55 77 D M 22 22 33...
Time​ (days) Immediate Time​ (days) Immediate Activity a m b ​Predecessor(s) Activity a m b ​Predecessor(s)...
Time​ (days) Immediate Time​ (days) Immediate Activity a m b ​Predecessor(s) Activity a m b ​Predecessor(s) A 55 55 77 long dash— H 44 44 66 ​E, F B 11 22 55 long dash— I 22 77 1010 ​G, H C 55 55 55 A J 22 44 77 I D 44 88 1313 A K 66 1010 1313 I E 11 1010 1717 ​B, C L 22 66 66 J F 11 55 77 D M 22 22 33...
The duration and resource usage for each activity are showed in the table below. Activity Predecessor...
The duration and resource usage for each activity are showed in the table below. Activity Predecessor Total Processing Time (days) # of painters required/day A --- 0.5 1 B --- 1 1 C A,B 1 1 D C 1 1 Assume the maximum number of painters is 1. Level the resources by following the rule "Delay the activity with the most positive slack first". Please indicate the schedule of acitivity B after leveling recources (Suppose the project begins on day...
The duration and resource usage for each activity are showed in the table below. Activity Predecessor...
The duration and resource usage for each activity are showed in the table below. Activity Predecessor Total Processing Time (days) # of painters required/day A --- 1 1 B --- 1 1 C A,B 0.5 1 D C 1 1 Assume the maximum number of painters is 1. Level the resources by following the rule "Delay the activity with the most positive slack first". How much slack time (in days) does acitivity C have after leveling recources?
The table below presents durations, direct costs and immediate predecessors for each activity of a project...
The table below presents durations, direct costs and immediate predecessors for each activity of a project executed by a contracting company, under both normal and crash conditions. The weekly indirect cost is L.E. 40. Activity Code Immediate Predecessors Normal Duration (week) Normal Total Direct Cost (L.E) Crash Duration (Week) Crash Total Direct Cost (L.E) Total Allowable crash Time (Week) Cost Slope per Week (L.E) A None 8 325 5 400 3 25 B None 12 1200 11 1320 1 120...
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...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT