Advertisements
Advertisements
प्रश्न
The critical path of the following network is
पर्याय
1 - 2 - 4 - 5
1 - 3 - 5
1 - 2 - 3 - 5
1 - 2 - 3 - 4 - 5
उत्तर
1 - 2 - 3 - 4 - 5
Explanation:
1 - 2 - 4 - 5 ⇒ EFT = 20 + 12 + 10 = 42
1 - 3 - 5 ⇒ EFT = 25 + 8 = 33
1 - 2 - 3 - 5 ⇒ EFT = 20 + 10 + 8 = 38
1 - 2 - 3 - 4 - 5 ⇒ EFT = 20 + 10 + 5 + 10 = 45
APPEARS IN
संबंधित प्रश्न
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 the project whose activities are given below.
Activity | 0 - 1 | 1 - 2 | 1 - 3 | 2 - 4 | 2 - 5 | 3 - 4 | 3 - 6 | 4 - 7 | 5 - 7 | 6 - 7 |
Duration (in week) | 3 | 8 | 12 | 6 | 3 | 3 | 8 | 5 | 3 | 8 |
Calculate the earliest start time, earliest finish time, latest start time and latest finish time of each activity. Determine the critical path and the project completion time.
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 |
One of the conditions for the activity (i, j) to lie on the critical path is
In the context of network, which of the following is not correct
The objective of network analysis is to
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.