Actually, they are asking for the critical path. Critical path is the longest path through the network, which corresponds to the minimum time to complete the project. D is the answer.They're not asking for the critical path. They are asking for the minimum time to complete the project. Look at the diagram from a common sense point of view. The minimum time that has to go by before Task D can start is limited by Activity 7, right? 30 days. Even if Activities 1, 2, and 3 can be done in 25 days, doesn't matter. The project can't go on until Activity 7 is complete. 30 days. Then Activities 4 and 5 will take 20 days. 30 + 10 + 10 = 50. The project can't go from start to finish any sooner than 50 days.
Actually, they are asking for the critical path. Critical path is the longest path through the network, which corresponds to the minimum time to complete the project. D is the answer.They're not asking for the critical path. They are asking for the minimum time to complete the project. Look at the diagram from a common sense point of view. The minimum time that has to go by before Task D can start is limited by Activity 7, right? 30 days. Even if Activities 1, 2, and 3 can be done in 25 days, doesn't matter. The project can't go on until Activity 7 is complete. 30 days. Then Activities 4 and 5 will take 20 days. 30 + 10 + 10 = 50. The project can't go from start to finish any sooner than 50 days.
I agreeActually, they are asking for the critical path. Critical path is the longest path through the network, which corresponds to the minimum time to complete the project. D is the answer.They're not asking for the critical path. They are asking for the minimum time to complete the project. Look at the diagram from a common sense point of view. The minimum time that has to go by before Task D can start is limited by Activity 7, right? 30 days. Even if Activities 1, 2, and 3 can be done in 25 days, doesn't matter. The project can't go on until Activity 7 is complete. 30 days. Then Activities 4 and 5 will take 20 days. 30 + 10 + 10 = 50. The project can't go from start to finish any sooner than 50 days.
This problem is really easy, it is asking for the "minimum' time to complete the building, so you are actually looking for the "longest" path.
7 > 4 > 5 = 50 days
35+10=45This problem is really easy, it is asking for the "minimum' time to complete the building, so you are actually looking for the "longest" path.
7 > 4 > 5 = 50 days
But wouldn't the longest path be 35 + 10 = 55?
Activity on Arc (AoA)
AoA (also known as Activity on Branch) has the activity represent by the arrows themselves and the nodes represent the precedence as points in time where predecessors have been completed. There are three simple rules to creating the AoA precedence diagram:
- All activities with no predecessor come off of node 1.
- All activities with no successor point to the last node, which has to have highest node number.
- Activities can have only one start node and only one end node.
- If an activity has multiple predecessors, a dummy node must be created.
Solving simple AoA diagrams can be done quickly by calculating the duration of each possible path through the network. The longest path is the project duration and identifies the critical path.
Enter your email address to join: