Activities A to K are required to complete a project. The time estimates and the immediate predecessors of these activities are given in the table. If the project is to be completed in the minimum possible time, the latest finish time for the activity G is ________________ hours.
Show Hint
To calculate the latest finish time of an activity, trace the longest path backward through the project network and apply backward scheduling.
We need to calculate the latest finish time for activity G, which depends on the activities that follow it. To determine this, we must calculate the project’s critical path and find the latest finish time for the activities.
Step 1: Identify the project activities and their dependencies:
Based on the table, we can see that activities B, C, D, and E must be completed before G, and the latest finish time for G depends on the subsequent activities: H and I.
Step 2: Determine the critical path:
We trace the longest path of the activities based on their dependencies to find the critical path. This helps us calculate the latest finish times for all activities.
Step 3: Calculate the latest finish time for G:
Using backward scheduling, we find that the latest finish time for G, considering all the constraints, is 10 hours.
Thus, the correct answer is (B) 10.
