Earliest and latest times for each activity are calculated by usung the forward-
ID: 374173 • Letter: E
Question
Earliest and latest times for each activity are calculated by usung the forward-pass and backward-pass method to find out the critical path.
Critical path is defined as the longest path from start to end and or made up of critical activities (having zero slack).
A Precedence Diagramming Method (PDM), which is sometimes also known as the Activity on Node (AON) Diagramming Method, is a graphical representation technique, which shows the inter-dependencies among various project activities.
Calculations are as follows:
C
After crashing activity L by three days, there is no other critical path.
Revised table is as follows:
Activity Predecessor Estimated Duration Earliest Start-ES Earliest Finish-EF Latest Start-LS Latest Finish-EF Slack = LF-ES-D A 2 0 2 0 2 0 Critical B 3 0 3 22 25 22 C 3 0 3 22 25 22 D A 3 2 5 2 5 0 Critical E D 3 5 8 5 8 0 Critical F E 2 8 10 8 10 0 Critical G F 3 10 13 12 15 2 H F 5 10 15 10 15 0 Critical I G, H 6 15 21 15 21 0 Critical J G 2 13 15 21 23 8 K H 4 15 19 17 21 2 L I, K 4 21 25 21 25 0 Critical M J 2 15 17 23 25 8 Critical path is Start--A--D--E--F--H--I--L--Finish , duration is 25 (2+3+3+2+5+6+4)Explanation / Answer
Draw (sketch) this network manually as a PDM network.
2. What is the critical path and the total project duration?
3 Which activity has the largest slack?
4. Crash the project by 3 days and re-identify the critical path?
Activity
Predecessor
Estimated Duration
A
2
B
3
C
3
D
A
3
E
D
3
F
E
2
G
F
3
H
F
5
I
G, H
6
J
G
2
K
H
4
L
I, K
4
M
J
2
Activity
Predecessor
Estimated Duration
A
2
B
3
C
3
D
A
3
E
D
3
F
E
2
G
F
3
H
F
5
I
G, H
6
J
G
2
K
H
4
L
I, K
4
M
J
2
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.