## Info

Note: Costs are given in thousands of dollars, time in weeks.

(a) Find the all-normal schedule and cost.

(b) Find the all-crash schedule and cost.

(c) Find the total cost required to expedite all activities from all-normal (case a) to all-crash (case b).

(d) Find the least-cost plan for the ail-crash time schedule. Start from the all-crash problem (b).

,'S. Given the data in Problem 7, determine the first activities to be crashed by the following priority rules-.

(b) Most resources first (use normal cost as the basis).

(d) Most critical followers.

(e) Most successors.

9. Consider Problem 10 in Chapter 8 again Suppose the duration of both activities A and D can be reduced to one day, at a cost of \$15 pef , day of reduction. Also, activities E, G, and H can ; be reduced in duration by one day at a cost of'. \$25 per day of reduction. What is the least costi| approach to crash the project two days? What is> the shortest "crashed" duration, the new critical* path, and the cost of crashing?

10. Given a network with normal times and crasHr.. times (in parentheses), find the optimal time-^ <â€¢ cost plan. Assume indirect costs are \$100 p? day. The data are:

Activity Time Reduction Direct Cost per Day