(e) time estimate (TE) = (TO + 4TM + TP)/ 6
Where TO = OPTIMISTIC TIME
TM = likely time
TP= PESSIMISTIC time
(f) standard deviation = (TP- TO)/6
VARIANCE = Square of standard deviation
Where TP= pessimistic time
TO= optimistic time
(g)
(H) (ì)(j)(k)
(l) Total float or slack comes zero only for activity in critical path. Hence our answer in (h) is confirmed.
The critical path are A-B-D-E-G-H and A-B-C-F-G-H
(J) Standard deviation of project = square root of variance of expected time of project
Variance of expected time = sum of variances of critical path activities
= 0.694+ 0.25+ 5.4444+0.6944+1.7778+3.3611
= 12.2213 (for critical path A-B-D-E-G-H)
Standard deviation of project= square root of variance
= 3.4959
For critical path A-B-C-FG-H , standard deviation = 3.036
Note: time limitation for answering last part
Using the following information about Project A, its activities and predecessor activities below: Activity Predecessors A...
Consider the following project activities: Calculate the expected time (te) for each activity. Draw an Activity on Node (AON) diagram to reflect the flow of these activities. Calculate the Early Start (ES), Early Finish (EF), Late Start (LS), and Late Finish (LF) for each activity. Calculate the slack for each activity. Identify all activities on the Critical Path. Use the data to calculate the probability the project will finish in 20 weeks (Hint: z-score). Activity A 8 с D E...
Consider the following project where times are in weeks. Activity Duration Immediate Predecessors A B с D E F G H A.B B A с E,F 8 12 7 4 2 3 7 3 DF a) Determine the activity schedule (ES, EF, LS, and LF) as well as slack using the information from the table above (11 marks) b) Determine all the possible paths of this project and determine the shortest possible time this project can be completed? (4 marks)...
Pik-Fast, a chain of convenience stores, is planning to open a new store. The activities required, their immediate predecessors, and the optimistic, most likely, and pessimistic estimates of their times (in days) are provided below. Activity Description Immediate Predecessors Optimistic Time (days) Most Likely Time (days) Pessimistic Time (days) TE ES EF LF LS Slack Standard Dev Variance A Select manager -- 10 12 20 13 0 1.67 B Select site -- 8 15 22 15 0 2.33 C Hire workers...
(15 points) Activity Immediate Predecessor Optimistic Time Most likely Time Pessimistic Time A NONE 4 7 9 B A 2 4 6 C A 6 9 9 D B, C 5 5 5 E C 2 5 9 F D, E 3 3 6 Use both the longest path method and ES/EF; LS/LF method for the following questions (e) What are the slack values for non-critical activities? (4 points) (f) What is the probability that the project will be...
Pik-Fast, a chain of convenience stores, is planning to open a new store. The activities required, their immediate predecessors, and the optimistic, most likely, and pessimistic estimates of their times (in days) are provided below. Activity Description Immediate Predecessors Optimistic Time (days) Most Likely Time (days) Pessimistic Time (days) TE ES EF LF LS Slack Standard Dev Variance A Select manager -- 10 12 20 13 0 1.67 B Select site -- 8 15 22 15 0 2.33 C Hire workers...
A small software development project has eight major activities. The times are estimated and provided in the table below: Activity Optimistic Time Most Likely Time Pessimistic Time Immediate Predecessor(s) A 3 4 5 -- B 5 7 9 -- C 2 3 10 A D 2 5 8 B E 1 7 7 B F 3 5 7 C, D G 7 8 9 D, E H 2 6 10 F Answer the following questions based on above table 1-2...
A construction company has a project proposal, which takes 10 activities as follows: Activity Predecessors Activity Duration Time (In DAYS ) Early Start (ES) (In DAYS ) Early Finish (EF) (In DAYS ) Late Start (LS) (In DAYS ) Late Finish (LF) (In DAYS ) SLACK (In DAYS ) A - 14 B - 13 C A 11 D A 15 E B 14 F B 11 G D, E 13 H F 15 J C 12 K G,H 11...
tual code de a Activity Predecessor Normal time A 2 B 3 C B A С 5 G. F H 15 HH 2 D И N M, J 1 - Calculate early start (ES), early finish (EF), late start (LS) and late finish (LF) for each activity - Draw Activity on Arrow network (AOA) - Draw Activity on Node network (AON) - Calculate slack of each activity - Determine the critical paths. There must be at least 2 critical paths...
Given the information in the following table: Activity Duration Predecessor A 4 None B 6 A C 4 A D 2 C E 4 B F 5 B, D G 3 C H 4 F, G I 2 E, H 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 path? Calculate the slack for each activity. How long will it take to complete the project?
Problem 5: For the given activity network, if there are 35 days required to complete the project, find the following Complete the network by filling in ES, LS, EF and LF Earliest start for activities D, E, F, H, G, L, M ill. Earliest finish for activities D, E, F, H,G,L,M Latest start for activities D, E, F, H, G, LM V. Latest finish activities D, E, F.H.GLM vi. Slack/Float time for each activities D, E, F, H, G, LM...