Consider the following project time and cost data:

Immediate Normal Expedited Normal Expedited Activity Predecessors Time Time Cost Cost A — 6 6 $ 200 $ 200 B A 10 4 600 1,000 C A 12 9 625 1,000 D B 6 5 700 800 E B 9 7 200 500 F C, D 9 5 400 840 G E 14 10 1,000 1,440 H E, F 10 8 1,100 1,460

a. Develop a network for this project.

b. Compute the earliest and the latest starting and finishing times for each of the activities. Find the slack time for each activity and identify the critical path.

c. Suppose that the indirect costs of the project amount to $200 per day. Find the optimal number of days to perform the project by expediting one day at a time.

What is the total project cost at the optimal solution? What savings have been realized by expediting the project?

d. Solve this problem using linear programming.