Scribd
Upload
21 views

Chapter 9 - Allocating Resource To The Project Problems Problem 1

This document discusses allocating resources to project activities. It presents 4 problems: 1) Identifying the critical path and most important task to crash. Task B has the lowest crash cost. 2) Calculating crash costs per day. Task B has the lowest cost of $37.50/day to crash. 3) Evaluating options to crash tasks to reduce project duration. Crashing tasks A and E is the lowest cost option. 4) Identifying the critical path of a network as B, D, G and that crashing may be prudent after analyzing schedule risks.

Uploaded by

Hannah Yusof
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views

Chapter 9 - Allocating Resource To The Project Problems Problem 1

This document discusses allocating resources to project activities. It presents 4 problems: 1) Identifying the critical path and most important task to crash. Task B has the lowest crash cost. 2) Calculating crash costs per day. Task B has the lowest cost of $37.50/day to crash. 3) Evaluating options to crash tasks to reduce project duration. Crashing tasks A and E is the lowest cost option. 4) Identifying the critical path of a network as B, D, G and that crashing may be prudent after analyzing schedule risks.

Uploaded by

Hannah Yusof
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Chapter 9 Allocating Resource to the Project

Problems
Problem 1:
a)

B is the shortest task.

b)

B, C, or D all have zero slack.

c)

B has the most critical followers.


d)

B has the most successors, 2.

Figure 1

Problem 2:
Activit
y

Crash Days

Crash $

$200.00

200.00

$ 75.00

37.50

$150.00

50.00

$100.00

50.00

Crash $/Day

Figure 2

Figure 9.2 uses the data


from problems 1 and 2 to
answer problem 2.
b)
Task B is on the
critical path and it has the
lowest cost per day $37.50
to crash (additional cost of
$75.00). It enables a 13-day
completion without making
any other new tasks critical.

Problem 3:
Figure 9.3a converts the AOA
diagram into an AON
diagram.
Figure 9.3a answers
questions for problem 3a.

Activity
Figure 9.3a

Crash Days

Normal $

Crash $

Crash $/Day

500.00

$300.00

100.00

200.00

$150.00

150.00

500.00

$400.00

200.00

200.00

$300.00

150.00

300.00

250.00

$250.00

the

Activity

Crash Days

Normal $

Normal $

$ 1,700.00

Crash $

Crash $/Day
Net Cost $

Option 1

A=1, E = 1

$350.00

$ 2,050.00

Option 2

A=2, D=1

$350.00

$ 2,050.00

Figure 9.3b responds to part b of problem 9.


4. The logic of compressing activities associated with training has to be examined
closely. If the activities have to do with preparation, then crashing may be appropriate.
If they are associated with classroom time, then crashing is probably a poor choice.
Problem 4:

Figure 9.4 shows the AON network data for problem 4.


c) The critical path is B, D, G as shown in Figure 9.4
d) On the surface the answer is no, since the duration as calculated is one month less than
the project deadline requires. It would be prudent, however, to perform analysis as
described in Chapter 8 to determine the probability of actually achieving this schedule.
Based on that analysis it may in fact be prudent to crash some activities.

You might also like