Advertisements
Advertisements
Question
Draw the network and calculate the earliest start time, earliest finish time, latest start time and latest finish time of each activity and determine the Critical path of the project and duration to complete the project.
| Jobs | 1 - 2 | 1 - 3 | 2 - 4 | 3 - 4 | 3 - 5 | 4 - 5 | 4 - 6 | 5 - 6 |
| Duration | 6 | 5 | 10 | 3 | 4 | 6 | 2 | 9 |
Advertisements
Solution
E1 = 0
E2 = 0 + 6 = 6
E3 = 0 + 5 = 5
E4 = 6 + 10 = 16
E5 = (5 + 4) or (16 + 6)
Whichever is maximum
= 22
E6 = (16 + 2) or (22 + 9)
Whichever is maximum
= 31
L6 = 31
L5 = 31 – 8 = 22
L4 = 22 – 6 = 16 or (31 – 2)
whichever is minimum
L3 = 22 – 4 = 18
L2 = 16 – 10 = 6
L1 = 6 – 6 = 0
| Activity | Duration tij |
EST | EFT = EST + tij | LST = LFT – tij | LFT |
| 1 - 2 | 6 | 0 | 6 | 6 – 6 = 0 | 6 |
| 1 - 3 | 5 | 0 | 5 | 18 – 5 = 13 | 18 |
| 2 - 4 | 10 | 6 | 16 | 16 – 10 = 6 | 16 |
| 3 - 4 | 3 | 5 | 8 | 16 – 3 = 13 | 16 |
| 3 - 5 | 4 | 5 | 9 | 22 – 4 = 18 | 22 |
| 4 - 5 | 6 | 16 | 22 | 22 – 6 = 16 | 22 |
| 4 - 6 | 2 | 16 | 18 | 31 – 2 = 29 | 31 |
| 5 - 6 | 9 | 22 | 31 | 31 – 9 = 22 | 31 |
Since EFT and LFT is same on 1 - 2, 2 - 4, 4 - 5 and 5 - 6, the critical path is 1 - 2 - 4 - 5 - 6 and duration time taken is 31 days.
APPEARS IN
RELATED QUESTIONS
Draw the network for the project whose activities with their relationships are given below:
Activities A, D, E can start simultaneously; B, C > A; G, F > D, C; H > E, F.
Draw the event oriented network for the following data:
| Events | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| Immediate Predecessors | - | 1 | 1 | 2, 3 | 3 | 4, 5 | 5, 6 |
Construct the network for each the projects consisting of various activities and their precedence relationships are as given below:
| Activity | A | B | C | D | E | F | G | H | I | J | K |
| Immediate Predecessors | - | - | - | A | B | B | C | D | E | H, I | F, G |
A project schedule has the following characteristics
| Activity | 1 - 2 | 1 - 3 | 2 - 4 | 3 - 4 | 3 - 5 | 4 - 9 | 5 - 6 | 5 - 7 | 6 - 8 | 7 - 8 | 8 - 10 | 9 - 10 |
| Time | 4 | 1 | 1 | 1 | 6 | 5 | 4 | 8 | 1 | 2 | 5 | 7 |
Construct the network and calculate the earliest start time, earliest finish time, latest start time and latest finish time of each activity and determine the Critical path of the project and duration to complete the project.
A Project has the following time schedule
| Activity | 1 - 2 | 1 - 6 | 2 - 3 | 2 - 4 | 3 - 5 | 4 - 5 | 6 - 7 | 5 - 8 | 7 - 8 |
| Duration (in days) | 7 | 6 | 14 | 5 | 11 | 7 | 11 | 4 | 18 |
Construct the network and calculate the earliest start time, earliest finish time, latest start time and latest finish time of each activity and determine the Critical path of the project and duration to complete the project.
The critical path of the following network is
The objective of network analysis is to
In critical path analysis, the word CPM mean
Draw the network diagram for the following activities.
| Activity code | A | B | C | D | E | F | G |
| Predecessor activity | - | - | A | A | B | C | D, E |
A Project has the following time schedule
| Activity | 1 - 2 | 2 - 3 | 2 - 4 | 3 - 5 | 4 - 6 | 5 - 6 |
| Duration (in days) |
6 | 8 | 4 | 9 | 2 | 7 |
Draw the network for the project, calculate the earliest start time, earliest finish time, latest start time and latest finish time of each activity and find the critical path. Compute the project duration.
