- Asked 4/26
- 2076 Chaitra · 13 marks
CPM components (AOA), activities A to I
Short answer
Using the AOA method, all CPM components are found: network with 8 events and 3 dummies, event times, EST/EFT/LST/LFT and all floats tabulated. Project duration is 17 weeks. Critical path is B-D-H-I (3+5+4+5 weeks).
Find all the components of CPM from the following information. Use the AOA method.
| Activity | Duration (week) | Predecessor |
|---|---|---|
| A | 1 | - |
| B | 3 | - |
| C | 2 | A, B |
| D | 5 | B |
| E | 3 | B |
| F | 1 | C, D |
| G | 3 | D |
| H | 4 | D, E |
| I | 5 | F, G, H |
The components of CPM are: the network, event times (TE, TL), activity times (EST, EFT, LST, LFT), floats (TF, FF, Int.F, Ind.F), the critical path and the project duration. All are found below with the activity-on-arrow (AOA) method.
Notation: EST/EFT = earliest start/finish, LST/LFT = latest start/finish, TF = total float, FF = free float, Int.F = interfering float, Ind.F = independent float.
Network diagram (activity-on-arrow)
Each activity is an arrow with its duration in brackets (weeks). Events are circled numbers; dashed arrows are dummy activities (zero duration) that show dependencies only.
(1) --B(3)--> (2)
(1) --A(1)--> (4)
(2) --D(5)--> (3)
(2) - - dummy - -> (4)
(2) --E(3)--> (5)
(3) - - dummy - -> (5)
(3) - - dummy - -> (6)
(3) --G(3)--> (7)
(4) --C(2)--> (6)
(5) --H(4)--> (7)
(6) --F(1)--> (7)
(7) --I(5)--> (8)
The network has 8 events and 3 dummy activities. Start event is (1) and the end event is (8).
Forward pass (EST and EFT)
Rule: EST = largest EFT of the preceding activities (0 for start activities); EFT = EST + D.
- A: EST = 0; EFT = 0 + 1 = 1
- B: EST = 0; EFT = 0 + 3 = 3
- C: EST = max(A:1, B:3) = 3; EFT = 3 + 2 = 5
- D: EST = EFT of B = 3; EFT = 3 + 5 = 8
- E: EST = EFT of B = 3; EFT = 3 + 3 = 6
- F: EST = max(C:5, D:8) = 8; EFT = 8 + 1 = 9
- G: EST = EFT of D = 8; EFT = 8 + 3 = 11
- H: EST = max(D:8, E:6) = 8; EFT = 8 + 4 = 12
- I: EST = max(F:9, G:11, H:12) = 12; EFT = 12 + 5 = 17
Project duration = largest EFT = 17 weeks.
Backward pass (LFT and LST)
Rule: LFT = smallest LST of the succeeding activities (project duration for end activities); LST = LFT - D.
- I: LFT = project duration = 17; LST = 17 - 5 = 12
- H: LFT = LST of I = 12; LST = 12 - 4 = 8
- G: LFT = LST of I = 12; LST = 12 - 3 = 9
- F: LFT = LST of I = 12; LST = 12 - 1 = 11
- E: LFT = LST of H = 8; LST = 8 - 3 = 5
- D: LFT = min(F:11, G:9, H:8) = 8; LST = 8 - 5 = 3
- C: LFT = LST of F = 11; LST = 11 - 2 = 9
- B: LFT = min(C:9, D:3, E:5) = 3; LST = 3 - 3 = 0
- A: LFT = LST of C = 9; LST = 9 - 1 = 8
Floats
- Total float
- Free float
- Interfering float
- Independent float
Result table
| Activity | D | EST | EFT | LST | LFT | TF | FF | Int.F | Ind.F |
|---|---|---|---|---|---|---|---|---|---|
| A | 1 | 0 | 1 | 8 | 9 | 8 | 2 | 6 | 2 |
| B | 3 | 0 | 3 | 0 | 3 | 0 | 0 | 0 | 0 |
| C | 2 | 3 | 5 | 9 | 11 | 6 | 3 | 3 | 0 |
| D | 5 | 3 | 8 | 3 | 8 | 0 | 0 | 0 | 0 |
| E | 3 | 3 | 6 | 5 | 8 | 2 | 2 | 0 | 2 |
| F | 1 | 8 | 9 | 11 | 12 | 3 | 3 | 0 | 0 |
| G | 3 | 8 | 11 | 9 | 12 | 1 | 1 | 0 | 1 |
| H | 4 | 8 | 12 | 8 | 12 | 0 | 0 | 0 | 0 |
| I | 5 | 12 | 17 | 12 | 17 | 0 | 0 | 0 | 0 |
Event times (TE from the forward pass, TL from the backward pass):
| Event | TE (earliest) | TL (latest) | Slack |
|---|---|---|---|
| 1 | 0 | 0 | 0 |
| 2 | 3 | 3 | 0 |
| 3 | 8 | 8 | 0 |
| 4 | 3 | 9 | 6 |
| 5 | 8 | 8 | 0 |
| 6 | 8 | 11 | 3 |
| 7 | 12 | 12 | 0 |
| 8 | 17 | 17 | 0 |
Critical path and project duration
- Critical activities (TF = 0): B, D, H, I
- Critical path: B - D - H - I (= 3+5+4+5 = 17 weeks)
Answer: project duration = 17 weeks; critical path = B - D - H - I
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- CPM components (AOA), 9 activities · Project Engineering, chapter 3 · asked 4×
- CPM components (AOA), 10 activities · Project Engineering, chapter 3 · asked 5×
- CPM components (AOA), 13 activities (months) · Project Engineering, chapter 3 · asked 5×
- CPM components, 9 activities with successors · Project Engineering, chapter 3 · asked 3×
- CPM network, 9 activities (A=3 to I=1) · Project Engineering, chapter 3 · asked 5×
- CPM network, 9 activities (A=5 to I=2) · Project Engineering, chapter 3 · asked 5×
- CPM precedence diagram, 9 activities · Project Engineering, chapter 3
- CPM network, 13 activities (A to M) · Project Engineering, chapter 3 · asked 5×
- CPM network, 13 activities (A=2 to M=7) · Project Engineering, chapter 3 · asked 5×
- TCTO numerical: least cost schedule, Rs 2000/week · Construction Management, chapter 2