Operations Research20825 marksNumerical: Critical path methodCritical path identification
Project Network Analysis The table gives the information about the activities, their predecessors and time duration required to complete the activities of the project. Find the shortest time duration of the project within which the project can be completed. | Activity | A | B | C | D | E | F | G | |
Project Network Analysis
The table gives the information about the activities, their predecessors and time duration required to complete the activities of the project. Find the shortest time duration of the project within which the project can be completed.
| Activity | A | B | C | D | E | F | G |
|---|---|---|---|---|---|---|---|
| Predecessor | - | - | B | B | B | E | A,D,C |
| Time (in days) | 18 | 8 | 14 | 14 | 16 | 10 | 20 |
[5]
Activity Predecessor Duration (days) ---------------------------------------- A - 18 B - 8 C B 14 D B 14 E B 16 F E 10 G A, D, C 20 $EF = ES + \text{Duration}$, and $ES = \max(EF \text{ of predecessors})$ Activity Predecessor ES EF ------------------------------- A - 0 18 B - 0 8 C B 8 22 D B 8 2...