Consider the following network: 1 4. CPM: 5 14 6 2 3 4 7 12 3...

 

Transcribed Image Text:

Consider the following network: 1 4. CPM: 5 14 6 2 3 4 7 12 3 9 12 5 2. SP: Find the shortest path from node 1 to node 7. 3. MF: Find the maximum flow from node 1 to node 7. 4 7 Find earliest & latest occurrence times for each event. Find critical path, minimum duration to complete the project and identify critical activities and non-critical activities. For the non-critical activities, compute total and free float and identify red flag activities. Create the time-schedule for all the activities. Consider the following network: 1 4. CPM: 5 14 6 2 3 4 7 12 3 9 12 5 2. SP: Find the shortest path from node 1 to node 7. 3. MF: Find the maximum flow from node 1 to node 7. 4 7 Find earliest & latest occurrence times for each event. Find critical path, minimum duration to complete the project and identify critical activities and non-critical activities. For the non-critical activities, compute total and free float and identify red flag activities. Create the time-schedule for all the activities.