Computation of earliest starting and finishing times is aided by two simple rules: | |||||||
1. The earliest finish time for any activity is equal to its earliest start time plus its expected | |||||||
duration, t: | |||||||
EF = ES + t | |||||||
2. ES for activities at nodes with one entering arrow is equal to EF of the entering arrow. ES | |||||||
for activities leaving nodes with multiple entering arrows is equal to the largest EF of the | |||||||
entering arrow. | |||||||
Computation of the latest starting and finishing times is aided by the use of two rules: | |||||||
1. The latest starting time for each activity is equal to its latest finishing time minus its | |||||||
expected duration: | |||||||
LS = LF - t | |||||||
2. For nodes with one leaving arrow, LF for arrows entering that node equals the LS of the | |||||||
leaving arrow. For nodes with multiple leaving arrows, LF for arrows entering that node | |||||||
equals the smallest LS of leaving arrows. | |||||||
Finding ES and EF times involves a forward pass through the network; finding LS and LF | |||||||
times involves a backward pass through the network. Hence, we must begin with the EF of the | |||||||
last activity and use that time as the LF for the last activity. Then we obtain the LS for the last | |||||||
activity by subtracting its expected duration from its LF | |||||||
Slack = LS-ES = LF-EF | |||||||
Activities for which Slack = 0 are in critical path |
Expected time | ES | EF | LS | LF | Slack | |
B | 29 | 29 | ||||
C | 18 | 18 | ||||
D | 13 | 13 | ||||
E | 24 | 24 | 35 | 59 | 35 | |
F | 27 | 27 | 29 | 56 | 29 | |
G | 32 | 32 | 18 | 50 | 18 | |
H | 37 | 37 | 13 | 50 | 13 | |
K | 36 | 36 | 59 | 95 | 59 | |
M | 39 | 39 | 56 | 95 | 56 | |
N | 26 | 26 | 69 | 95 | 69 | |
P | 35 | 35 | 50 | 85 | 50 | |
Q | 95 | |||||
R | 99 | |||||
S | 85 |
LF:
E = 59
F = 56
G = 50
B = 29
C = 18
You are STA FIN The duration of activity K, M, N, and P are 36, 39,...
Given is a CPM project network diagram as shown below.
Activity
Start
A
B
C
D
E
F
G
H
End
day
0
5
6
9
6
9
8
5
4
0
a) The Project Completion time = days.
b) The Earliest Start time, ES, of Activity G = days.
c) The Latest Finish time, LF, of Acitivity C = days..
d) The critical activities are = (ex. Fill in answer as: ABCD)
End Start
Activity D is the immediate predecessor of activities K and M. If the latest start time of K is at the end of day 99 and the latest start time of M is at the end of day 106, the latest finish time of D should be at the end of day
Given is a CPM project network diagram as shown below. A F Start E H End B D G Start H Activity day А 6 B 3 с 8 D 7 E 4 F 9 G 4 End 0 0 6 a) The Project Completion time = days. b) The Earliest Start time, ES, of Activity G - days. c) The Latest Finish time, LF, of Acitivity - dayy d) The critical activities are (ex. Fill in answer as: ABCD)
QUESTION 5 Given is a CPM project network diagram as shown below. А F Start E H End B D G Start A B C D E F G H End Activity day 0 6 زر 8 7 4 9 4 6 0 a) The Project Completion time = days. b) The Earliest Start time, ES, of Activity G= days. c) The Latest Finish time, LF, of Acitivity C = days. d) The critical activities are = (ex. Fill in...
QUESTION 5 Given is a CPM project network diagram as shown below. A с F Start E H End B D Start A B E H End Activity day с 7 D 3 F 5 G 6 0 2 4 3 0 a) The Project Completion time = days. b) The Earliest Start time, Es, of Activity G = days. c) The Latest Finish time, LF, of Acitivity C - days. d) The critical activities are (ex. Fill in answer...
please show answers clearly
12 points Save Answer QUESTION 5 Given is a CPM project network diagram as shown below. F А H End E Start G B D E F Activity day Start 0 A 5 B 6 Ula G 5 H 4 End 0 ON 9 8 days. a) The Project Completion time = days. b) The Earliest Start time, ES, of Activity G= days.. c) The Latest Finish time, LF, of Acitivity C = d) The critical...
Given is a CPM project network diagram as shown below. A וד H End Start التا B D G A F H Activity day Start 0 B 8 с 3 D 5 E 6 وانما | End 0 8 4 a) The Project Completion time = days b) The Earliest Start time, ES, of Activity G = days. c) The Latest Finish time, LF, of Acitivity C = days d) The critical activities are = (ex. Fill in answer as:...
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...
QUESTION 5 Given is a CPM project network diagram as shown below. A F Start H End B D G B Activity days Start 0 A 2 H D 3 E 4 F 2 G 3 6 8 End 0 2 a) The Project Completion time days. b) The Earliest Start time, ES, of Activity G - days. c) The Latest Finish time, LF, of Acitivity C- days. d) The critical activities are (ex. Fill in answer as: ABCD)
QUESTION 5 Given is a CPM project network diagram as shown below. А C F Start E Н. End B D G A B D E F G H Activity day Start 0 с 8 End 0 6 3 7 4 9 4 6 a) The Project Cor etion time = days b) The Earliest Start time, ES, of Activity G- days. c) The Latest Finish time, LF, of Acitivity - days. d) The critical activities are = (ex. Fill...