Advertisements
Advertisements
Question
The following table use the activities in a construction projects and relevant information
| Activity | 1 - 2 | 1 - 3 | 2 - 3 | 2 - 4 | 3 - 4 | 4 - 5 |
| Duration (in days) |
22 | 27 | 12 | 14 | 6 | 12 |
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.
Advertisements
Solution
E1 = 0
E2 = 22 + 0 = 22
E3 = (0 + 27) or (22 + 12)
Whichever is maximum
E3 = 34
E4 = (22 + 14) or (34 + 6)
Whichever is maximum
E4 = 40
E5 = 40 + 12 = 52
L5 = 32
L4 = 52 – 12 = 40
L3 = 40 – 6 = 34
L2 = (40 – 14) or (34 – 12)
whichever is minimum
= 22
L1 = 22 – 22 = 0
| Activity | Duration tij |
EST | EFT = EST + tij | LST = LFT – tij | LFT |
| 1 - 2 | 22 | 0 | 22 | 22 – 22 = 0 | 22 |
| 1 - 3 | 27 | 0 | 27 | 34 – 27 = 7 | 34 |
| 2 - 3 | 12 | 22 | 34 | 34 – 12 = 26 | 34 |
| 2 - 4 | 14 | 22 | 36 | 40 – 14 = 26 | 40 |
| 3 - 4 | 6 | 34 | 40 | 40 – 6 = 34 | 40 |
| 4 - 5 | 12 | 40 | 52 | 52 – 12 = 40 | 52 |
Since EFT and LFT are same in 1 - 2, 2 - 3, 3 - 4 and 4 - 5.
Hence the critical path is 1 - 2 - 3 - 4 - 5 and the duration of time taken is 52 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.
Construct the network for the projects consisting of various activities and their precedence relationships are as given below:
A, B, C can start simultaneously A < F, E; B < D, C; E, D < 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.
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 |
The following table gives the activities of a project and their duration in days
| Activity | 1 - 2 | 1 - 3 | 2 - 3 | 2 - 4 | 3 - 4 | 3 - 5 | 4 - 5 |
| Duration | 5 | 8 | 6 | 7 | 5 | 4 | 8 |
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.
In constructing the network which one of the following statements is false?
The objective of network analysis is to
Draw a network diagram for the following activities.
| Activity code | A | B | C | D | E | F | G | H | I | J | K |
| Predecessor activity | - | A | A | A | B | C | C | C, D | E, F | G, H | I, J |
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.
