Assume you have a project with ten activities labeled A-J, as shown. Derive the earliest completion time
Fantastic news! We've Found the answer you've been seeking!
Question:
Assume you have a project with ten activities labeled A-J, as shown. Derive the earliest completion time (or early finish-EF), latest completion time (or late finish-LF), and slack for each of the following tasks (begin at time = 0). What tasks are on the critical path? Highlight the critical path on your network diagram.
Activity | Preceding Event | Expected Duration | EF | LF | Slack | Critical Path? |
A | - | 4 | ||||
B | A | 5 | ||||
C | A | 6 | ||||
D | A | 7 | ||||
E | A, D | 6 | ||||
F | C, E | 5 | ||||
G | D, E | 4 | ||||
H | E | 3 | ||||
I | F, G | 4 | ||||
J | H, I | 5 |
Explain what would happen if:
1. Task E is postponed by 3 days
2. Task G is postponed by 2 days
Related Book For
Posted Date: