Problem $7.$

Using the project information below and least$-$cost method, reduce the schedule until you reach the crash point of the network.

For each move, identify the activities crashed and the adjusted total cost. Initial project duration is $13$ and total direct cost is $$1,000.($Method: Manual, Points: $15)$

Activity Duration Predecessor Activity Slope Maximum crash Normal time Normal cost Paths

A $2$x None A $002150$ https:$//$www$.$chegg.com$/$homework$-$help$/$questions$-$and$-$answers$/2-$using$-$project$-$information$-$least$-$cost$-$method$-$reduce$-$schedule$-$reach$-$crash$-$point$-$network$-$mo$-$q$106284600$

B $3$ A B $12013125$

C $6$ B C $8026220$

D $4$ B D $9514180$

E $3$ D E $11013200$

F $1$x C and E F $001175$

Critical Path Duration cost Crash slope

A $21500$

B $31251120$

D $4180195$

E $31101110$

F $100$

$13565325890$