Time(days) | |||||||||||||
activity | predecessor | a | m | b | Ex Time = a+b+4m / 6 | Std Dev =b-a / 6 | Variance =Std Dev ^2 | ES | EF | Critical | LS | LF | Slack |
A | - | 2 | 4 | 6 | 4.00 | 0.67 | 0.44 | 0.00 | 4.00 | 4.50 | 8.50 | 4.50 | |
B | - | 2 | 2 | 3 | 2.17 | 0.17 | 0.03 | 0.00 | 2.17 | 3.67 | 5.83 | 3.67 | |
C | - | 5 | 8 | 12 | 8.17 | 1.17 | 1.36 | 0.00 | 8.17 | Yes | 0.00 | 8.17 | 0.00 |
D | A | 4 | 6 | 10 | 6.33 | 1.00 | 1.00 | 4.00 | 10.33 | 8.50 | 14.83 | 4.50 | |
E | D | 7 | 9 | 12 | 9.17 | 0.83 | 0.69 | 10.33 | 19.50 | 14.83 | 24.00 | 4.50 | |
F | A | 3 | 4 | 8 | 4.50 | 0.83 | 0.69 | 4.00 | 8.50 | 14.67 | 19.17 | 10.67 | |
G | F | 5 | 7 | 9 | 7.00 | 0.67 | 0.44 | 8.50 | 15.50 | 19.17 | 26.17 | 10.67 | |
H | E | 1 | 2 | 4 | 2.17 | 0.50 | 0.25 | 19.50 | 21.67 | 24.00 | 26.17 | 4.50 | |
I | B | 2 | 3 | 6 | 3.33 | 0.67 | 0.44 | 2.17 | 5.50 | 5.83 | 9.17 | 3.67 | |
J | I | 1 | 2 | 4 | 2.17 | 0.50 | 0.25 | 5.50 | 7.67 | 9.17 | 11.33 | 3.67 | |
K | J | 4 | 5 | 8 | 5.33 | 0.67 | 0.44 | 7.67 | 13.00 | 11.33 | 16.67 | 3.67 | |
L | C | 1 | 1 | 1 | 1.00 | 0.00 | 0.00 | 8.17 | 9.17 | Yes | 8.17 | 9.17 | 0.00 |
M | L | 6 | 7 | 11 | 7.50 | 0.83 | 0.69 | 9.17 | 16.67 | Yes | 9.17 | 16.67 | 0.00 |
N | K,M | 8 | 9 | 13 | 9.50 | 0.83 | 0.69 | 16.67 | 26.17 | Yes | 16.67 | 26.17 | 0.00 |
Ans A | Finish | 26.17 | |||||||||||
Ans A | Critical Path | CLMN | |||||||||||
Ans A | Activity Variance | 2.75 | (Sum of Critical task variances) | ||||||||||
Ans 2 | M | Mean | 26.167 | Ex time(7,8,9) | |||||||||
S | Std Dev | 1.658 | (sqrt(sum(var(CLMN))) | ||||||||||
X | Completion | 27.000 | target | ||||||||||
P | Probability | 0.692 | NORM.DIST(X,M,X,TRUE) |
Pert chart:
Orange is Critical path.
at PBI airport. The table aso provides the immedate predecessor event for each activity and the...
for each problem I have this setup so far. I need help on each part and im not too sure if I am on the right track for each question on the picture. this chapter is on project management for statistics 1. A project is shown by the following network. The durations of activities (in weeks) are indicated on the arrows. a. Identify all of the paths, compute the length of each, identify the critical path and the b. Determine...
A project manager discovers that his team has neglected to complete the network diagram for the project. the network diagram is shown below. however the project manager has some information available, specifically that each activity a-g, has a different duration between one and seven weeks. also the slack time for each of the activity is known as shown belowDuration (weeks): 1,2,3,4,5,6,7 Slack time (weeks): 0,0,0,1,1,3,7 A D E G B FINISH START C F Using the clues provided below, determine...
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?
1. State whether each of the following statement is true or false. a) The sequence of activities in a project is depicted by the precedence (0.5 mark) (0.5 mark) relationships. The critical path is the shortest path through the project network. Slack is the amount of time an activity can be delayed without delaying the project. In PERT, three time estimates (optimistic, most likely and pessimistic) provide an estimate of the mean and variance for each activity based on the...
.8-6. A project consists of 12 activities, represented by the project network below, where number by each arc represents the duration (in days) of the associated activity 4 12 4 12 10 a) Find the earliest time, latest time, and slack for each event as well as the slack for each activity. Also identify the critical path. (b) The project has been scheduled to be completed in the minimum possible time.If all previous activities have begun as early as possible...
Activity Predecessor Optimistic time Most likely time Pessimistic time A - 3 5 8 B - 4 6 10 C A,B 2 5 8 D B 3 5 9 E A,C 3 6 9 F C,E 1 3 5 G C,D 3 4 9 H D 4 6 10 I F,G 3 4 9 J H 2 4 6 A).Draw the project network b).what is the expected completion time of the project. c) after your calculation, if you find one...
1. Consider the following project. Activity Duration (weeks)5 Immediate Predecessor(s) Cost (S) 1000 | 400 I 200 | 1200 | 500 | 700 | 1200 | 800 | 1800 | 1500 | 400 (a) Construct the activity-on-node (AoN) network for the relations among the activities in the (b) Using the activity-on-node (Ao) network developed in part (a), determine the critical path and the minimum time required to complete the project. Develop the earliest start and finish times, the latest finish...
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 Draw the network diagram and answer the following questions. (a) Calculate the expected duration of each activity. (b) Calculate the expected duration and variance of the critical path....
Using the following information about Project A, its activities and predecessor activities below: Activity Predecessors A в B C D E, F D G The following table contains the pessimistic, likely, and optimistic estimates for how long activities are estimated to take for Project A. Activity Pessimistic Likely Optimistic 2 5 20 H 16 e. Calculate the time estimates (TE) f. Calculate the variance (s) g. Convert the TE to whole integers and place them in the network diagram for...
A Question 11 The following table provides a list of activities in a project, along with their respective durations and precedence requirements: Immediate Duration Activity Predecessor(s) (weeks) 2 B 3 C B D А E A.C 1 F DE 3 с 3 2 6 G Determine the amount of slack time for Activity E: a. O weeks b. 1 week C. 2 weeks O d. 3 weeks Question 12 Assume that activity A has the following times: Early start time...