0% found this document useful (0 votes)
17 views

Sample Prob 1 2 Crashing

Crashing Time Activity

Uploaded by

carbajalthirdz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views

Sample Prob 1 2 Crashing

Crashing Time Activity

Uploaded by

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

SAMPL PROBLEM 1

8
J = = S =

i
CRITICAL PATH =
A -
C -

E
(=

S = 1 5= 1

-
CRASH #

.)
a
Key PONTS IN CRASHING (CHOOSING WHAT TO CRASH AT MINIMA COST

CRASH ACTIVITIES ONLY ON CRITICAL PATH

·
3 = 5

13 DAYS DURATOT
STAYS
CRITICAL PATH
THE SAME

TOTAL COST-1200

CRASH C

PATH

iii
b) S = 1
New CRITICAL
B -
D -

#100 00

s
.
CRASH B

CRASHING B TURNS ALL PATH CRITICAL

·
S = =

* -
4 -
#
S y
=

B -
D -
#
f =

Kost: Jo

CRASHD BY IDAY
COST : 900 .
28

i CRITICh PATH : A-X E -

-
CRASH A BY 1 DAY

i
10 DAYS DURATION
-
costo

- totph Minimum cost


= .
0

C )
.

To get the minimum completion time, try crashing all activities to its maximum crash time. Then try
crashing activities only on the critical path ( first critical path). Compare the two. If the two
completion times differ, it indicates that the critical path has shifted as a result of crashing all
activities. This happens because crashing some non-critical activities may have created new paths
with durations as long as the original critical path, effectively changing which activities are critical.
In this case, the critical path is not consistent throughout the crashing.

ANSWER : 8 DAYS
CRASH, =
CC -

NC
CosyPeriod TuT-CT
S
-

CRASH cost/ week


ACTIVITY NT NW CT C
7Y 50 000 88
1-2 12 30 008
, , 4808 .

S
2 3 .

& 20 000
,
35, 508 5888 .
88
3
4 40, 808 70 , 080 38 , 800 58

%
2
-
.

2 -

4 8 z z z

11, 088
i
i
4 S -
Sor 2888 85 .

4 -
6 588, 000 710 , 208 78 , 888 .
88

i
5-6 588 11 , 000 2888 . 88

6 7 -

158 000
, 220 , 000 78 888,
:
50

S= 8

·
S = 5

·
*
DURATION = 35 Weeks
3
CRITICAL PATH = (1 2)
- -

( 3)
-
-

13 -4) ,

(4 6)
-

=
(6 7)-
9) TO GET 30 Weeks TRY CRASHING THE PROJECT BY 6 Weeks

(SINCE MINIMUM COST IS NOT PRIORHIZE ,


YOU CAN CRASH ACTIVITIES SIMULTANEOUSLY

* THERE ARE ALSO X LOT OF COMBINATION OF ACTIVITIES THAT YOU CAN CRASH TO GET 38 WeeK]

a) If AT MINIMUM COST :
CRASH ACT . (12) By S weeks it will become 7 weeks

CRASH ACT . (2-3) By I week it will become 7 weeks

CRASH (1-2) PND (2-3)


** COST =
S(4500) + Foto

Eter
·
S =
=

&
J= 3

ANOTHER ONE:

CRASH ACT . (12) By S weeks it will become 7 weeks

CRASH ACT . (6-7) By I week it will become 7 weeks

·
S = 8 EXTRA COST
s(4000) + 70 ,
000
out

- 5= 4

-
d. -= 5

To get the minimum completion time, try crashing all activities to its maximum crash time. Then try
crashing activities only on the critical path ( first critical path). Compare the two. If the completion
time for crashing all activities matches the completion time for crashing only the critical activities, it
suggests that the critical path is consistent throughout the crashing process. This means that the
same set of activities continues to determine the project duration, even after crashing.

ANSWER : 24 WEEKS

#;
COST (KRASHING CRITICAL ACTIVITIES ONLY) = 5(4000) +
3(500) + 3(70 000)
,
+ 1175, 000)
= 315 800
, .
88

You might also like