Question

62.

Task ID	Predecessors	Normal Time	Maximum Crash Time	Normal Cost	Crash Cost (Slope)
1	-	5	1	50	20
2	-	3	2	60	60
3	1	4	0	70	0
4	1	2	1	50	10
5	2	5	3	100	60
6	3	2	1	90	100
7	4	5	1	50	30
8	5	2	0	60	40
9	6,7,8	3	1	200	200

Consider the project above. If the indirect costs of the project are: $90 at 15 days, $75 at 14 days, $50 at 13 days, $40 at 12 days, and $30 at 11 days.

Please help crash this project in a manner that minimizes the sum of the total direct and indirect costs. Answer the next 9 questions based on this data.

What is the current estimated project duration in days without any crashing?

		11
		14
		13
		15

63.

What is the current critical path?

		1-3-6-9
		1-4-6-9
		2-5-8-9
		None of the above

64.

Currently, which is the cheapest task to crash that can reduce project duration?

		Task 4
		Task 3
		Task 1
		Task 7

65.

After the first iteration of crashing, what is/are the critical path(s)?

		More than one path is critical
		1-4-7-9
		1-3-6-9
		2-5-8-9

66.

After the first iteration of crashing, what is the total sum of direct and indirect costs of the project?

		840
		815
		830
		825

67.

Which is the cheapest task to crash for the second iteration that can reduce project duration?

		Task 2
		Task 5
		Task 1
		Task 6

68.

After the second iteration of crashing, what is/are the critical path(s)?

		1-3-6-9
		1-4-7-9
		2-5-8-9
		All of the above

69.

After the second iteration of crashing, what is the total sum of direct and indirect costs of the project?

		810
		825
		830
		840

70.

What is the maximum time we can reduce the duration of the project by, for the third iteration of crashing?

		0
		3
		1
		2

Answer 1

Answer summary: precedence diagram and finding the critical paths, duration, crashing.