You plan to compress the schedule using a one$-$time unit per move and the least cost method.

You want to reduce the schedule until you reach the maximum crash point $($crash duration$)$ of the network.

You have already identified which activities to crash and the crashing order of these activities to reach the crash point.

The crashing order is the following:

Iteration $1-$ activity B

Iteration $2-$ activity B

Iteration $3-$ activity E

Iteration $4-$ activity C

Iteration $5-$ activity D

What will the total cost of the project be after iteration $1?$

You can use the Excel file Q$66-$Schedule Crashing as a helping tool. No need to upload the solution in Excel.

Answer:

Question $67$

Not yet answered

Marked out of $1\mathrm{.}0$

Flag question

Question text

What will the cost of the project be after iteration $2?$

Answer:

Question $68$

Not yet answered

Marked out of $1\mathrm{.}0$

Flag question

Question text

What will the cost of the project be after iteration $3?$

Answer:

Question $69$

Not yet answered

Marked out of $1\mathrm{.}0$

Flag question

Question text

What will the cost of the project be after iteration $4?$

Answer:

Question $70$

Not yet answered

Marked out of $1\mathrm{.}0$

Flag question

Question text

What will the cost of the project be after iteration $5?$

Answer:

Question $71$

Not yet answered

Marked out of $1\mathrm{.}0$

Flag question

Question text

What is the project duration at the crash point?

a$.$

$23$ weeks

b$.$

$20$ weeks

c$.$

$24$ weeks

d$.$

$21$ week

e$.$

$22$ weeks