Consider the following algorithm for the Critical Path Method( CPM)

a) Construct the corresponding CPM project network.

b) Number activity nodes in your project network so that every arc(i,j) has i

c) Use the CPM algorithm with your activity numbering to compute early start times for each activity and an early finish time for the entire project.

d) Use d[k] labels of your scheduling computations to identify the activities along a critical path from project start to finish. Mark the corresponding arcs in your network.

e) Compute late start times for each activity assuming that construction must be complete in 35 days. Explain how you do this.

Consider the following algorithm for the Critical Path Method CPM) Begin Step 0: Initialization Number activity nodes so that each arc of the CPM project network has i. Then initialize the schedule time of the project start node as v[start] 0 Step 1: Stopping. Terminate if the earliest start time of the project finish node has been fixed. Otherwise, let be the lowest number of an unprocessed node Step 2: Processing compute the activity earliest start schedule time using ar, the duration of activity hp] max(v{i] + a. : i is a predecessor of P} and let du the number of a node l achieving the maximum. Then return to Step 1, End Construction of a small two-story house involves the tasks listed in the following table. The table also shows the estimated duration of each task in days and the tasks that must be completed before it can begin Consider the following algorithm for the Critical Path Method CPM) Begin Step 0: Initialization Number activity nodes so that each arc of the CPM project network has i. Then initialize the schedule time of the project start node as v[start] 0 Step 1: Stopping. Terminate if the earliest start time of the project finish node has been fixed. Otherwise, let be the lowest number of an unprocessed node Step 2: Processing compute the activity earliest start schedule time using ar, the duration of activity hp] max(v{i] + a. : i is a predecessor of P} and let du the number of a node l achieving the maximum. Then return to Step 1, End Construction of a small two-story house involves the tasks listed in the following table. The table also shows the estimated duration of each task in days and the tasks that must be completed before it can begin