Full name : Phạm Thị Khánh Linh

ID : BABAWE13276

Chapter 9 resource allocation

Assignments
Assignment 1:
The given problem is

Immediate Normal Normal Crash Crash

Activity Predecessors Time Cost Time Cost

A - 2 1200 2 0

B A 5 1800 4 600

C B 6 1700 4 400

D B 7 1500 5 700

E C,D 4 1900 3 500

Edge and it's preceded and succeeded node

Edge Node1 → Node2

A 1→2

B 2→3

C 3→4

D 3→5

d 4→5

E 5→6
The network diagram for the project, along with activity time, is
Forward Pass Method

E1=0

E2=E1+t1,2 [t1,2=A=2]=0+2=2

E3=E2+t2,3 [t2,3=B=5]=2+5=7

E4=E3+t3,4 [t3,4=C=6]=7+6=13

E5=Max{Ei+ti,5}[i=3,4]

=Max{E3+t3,5;E4+t4,5}

=Max{7+7;13+0}

=Max{14;13}

=14

E6=E5+t5,6 [t5,6=E=4]=14+4=18

Backward Pass Method

L6=E6=18

L5=L6-t5,6 [t5,6=E=4]=18-4=14

L4=L5-t4,5 [t4,5=d=0]=14-0=14

L3=Min{Lj-t3,j}[j=5,4]

=Min{L5-t3,5;L4-t3,4}

=Min{14-7;14-6}

=Min{7;8}

=7

L2=L3-t2,3 [t2,3=B=5]=7-5=2
L1=L2-t1,2 [t1,2=A=2]=2-2=0

The critical path in the network diagram has been shown. This has been done by double lines by joining
all those events where E-values and L-values are equal.

The critical path of the project is : 1-2-3-5-6 and critical activities are A,B,D,E

The total project time is 18

The network diagram for the project, along with E-values and L-values, is

Critical activity Crash cost per week (Rs)

A (1 - 2) -

B (2 - 3) 600-18005-4=-1200

C (3 - 4) 400-17006-4=-650

D (3 - 5) 700-15007-5=-400

d (4 - 5) -

E (5 - 6) 500-19004-3=-1400
Total cost = Direct normal cost + Indirect cost for 18 weeks = 8100 +18×0=8100

To begin crash analysis, the crash cost slope values for critical activities is

Critical activity Crash cost per week (Rs)

A (0 - 1) × (Crashed)

B (1 - 2) 600-18005-4=-1200

D (2 - 4) 700-15007-5=-400

E (4 - 5) 500-19004-3=-1400
The critical activity A with cost slope of Rs "Undefined" per week, is the least expensive and can be
crashed by 0 weeks
Forward Pass Method

E1=0

E2=E1+t1,2 [t1,2=A=2]=0+2=2

E3=E2+t2,3 [t2,3=B=5]=2+5=7

E4=E3+t3,4 [t3,4=C=6]=7+6=13

E5=Max{Ei+ti,5}[i=3,4]

=Max{E3+t3,5;E4+t4,5}

=Max{7+7;13+0}

=Max{14;13}

=14

E6=E5+t5,6 [t5,6=E=4]=14+4=18

Backward Pass Method

L6=E6=18

L5=L6-t5,6 [t5,6=E=4]=18-4=14

L4=L5-t4,5 [t4,5=d=0]=14-0=14

L3=Min{Lj-t3,j}[j=5,4]

=Min{L5-t3,5;L4-t3,4}

=Min{14-7;14-6}

=Min{7;8}

=7

L2=L3-t2,3 [t2,3=B=5]=7-5=2

L1=L2-t1,2 [t1,2=A=2]=2-2=0

The critical path in the network diagram has been shown. This has been done by double lines by joining
all those events where E-values and L-values are equal.

The critical path of the project is : 1-2-3-5-6 and critical activities are A,B,D,E

- The total project time is 18

The network diagram for the project, along with E-values and L-values, is
Crashing schedule of project

Crashing Direct Direct

Project activity and Normal Crashing Total (Normal
duration time Cost Cost + Crashing) Indirect Cost Total Cost

18 8100 8100 18×0=0 8100

Assignment 2:
Network Diagram using Normal Time(days):

Based on the below Network Diagram, we find critical path - A-D-F-G, as activities on the critical path
have zero float, Expected completion time=25 days

Legends:

Early Start=Highest Early finish Activity ID Early Finish=Early Start +

time of all the predecessor activities    Duration

Total Float=Late Start-Early Start Duration Total Float = Late Finish –Early
Finish
 Late start=Late Finish-Duration Resource Late Finish=Lowest Late start
of all the successor activities
If I want to complete the project in 22 days time, we will consider minimum cost schedule,

First schedule has lowest project completion cost with $520

Total cost = 70+80+60+50+100+70+70= 500

Total cost = 70+80+60+150+100+40+70 =570

Assignment 3:
Here, Critical Path is A-B-E, as each activity on critical path has Zero float, further, Project needs at least
12 days time to complete.

For crashing purpose, we will select critical path activities to crash,

As, project has to meet 10 days duration time, hence, we have two options to crash

Option 1:

Crash A by 3 days and Crash E by 1 days,

Extra cost=(800-500)+(550-300)=300+250=550

New critical path would be generated, New Critical Path is =C-D-E

Option 2:

Crash B by 1 day and E by 1 day,

Extra Cost=(350-200)+(550-300)=150+250=400

There will be 2 critical path, these are A-B-E and C-D-E

We will choose Option 2 to meet 10 days duration time.

1.

Crash allowable crash

Normal time Normal cost time Crashed crash limit cost per
Activity (Days) ($) (days) cost (total) (days) day ($)

A 7 500 4 800 3 100

B 3 200 2 350 1 150

C 6 500 4 900 2 200

D 3 200 1 500 2 150

E 2 300 1 550 1 250

2. Path 1-2-4-5 takes 12 days while path 1-3-4-5 takes 11 days. Hence 1-2-4-5 is the critical path. We
need to crash time on critical path. Since path 4-5 takes 2 days and crash cost per day is higher, we need
to also look at crashing the activity on 1-3-4.
Hence A can be crashed by 2 days with cost of 2* $ 100 to 1-2-4 become 8 days. also D can be crashed
by 1 day with cost of 1*$150 to 1-3-4 become 8 days.

3. New cost is 700+200+500+350+300 = $ 2050

4.

Yes, we need to crash a task partially; usually Crashing is done using more resources, giving employees
and staffs Incentives. The main objective is to reduce the duration of some specific tasks and overall
duration of the project. To reduce overall duration of the project, we will be reducing duration of some
critical tasks partially or to an extent considering minimum crashing cost. Every task has some
importance, we can’t reduce such task time to Zero or we can’t fully crash a task. Hence, we can reduce
duration to a task to an extent or partially; specifically we will chose critical path activities to crash, as
critical path activities have zero or no float.

So, partial crashing would be good assumption in this kind of project.

Assignment 4:
1. We will first draw network diagram based on duration and precedence details

Now, we will find the critical path. The critical path is the path with longest completion time. We
will look at all possible paths and calculate total time for all paths to find the critical path. The
project duration is the total time for the critical path.

Possible paths:

• A-B-C-E: 2+5+6+4= 17

• A-B-D-E: 2+5+7+4= 18

Critical path with longest completion time is A-B-D-E and project duration is 18 days
2.

We will use below approach for the calculation of slack.

Earliest Start Time (ES) = the earliest time that an activity can begin

Earliest Finish Time (EF) = the earliest time that an activity can be completed
 EF = ES + duration of activity

Latest Start Time (LS) = the latest time that an activity can begin without lengthening the minimum
project duration

Latest Finish Time (LF) = the earliest time than an activity can be completed without lengthening the
minimum project duration

LF = LS + duration of activity

Duration of the project = the difference between the maximum value of the "latest finish time" of
projects and the minimum value of the "earliest start time" of projects

Project duration = max(LF) - min(ES)

Slack = the amount of time that a project can be delayed without increasing the duration of the
project

Slack = LF- LS or EF - ES

Critical path is the path with Total Slack = 0

Early Early Late Late

Predecessor Normal Crash Critical
Activity Start Finish Start Finish Slack
s Duration Duration Path
(ES) (EF) (LS) (LF)

A - 2 2 0 2 0 2 0 Y

B A 5 4 2 7 2 7 0 Y

C B 6 4 7 13 8 14 1

D B 7 5 7 14 7 14 0 Y

E C,D 4 3 14 18 14 18 0 Y

3. Below is the crash details given

Normal Crash Normal cost of Add. cost/ day to

Activity Predecessors
Duration Duration activity ($) crash ($)

A - 2 2         1,200                 -  

B A 5 4         1,800              600

C B 6 4         1,700              400

D B 7 5         1,500              700

 E C,D 4 3         1,900              500
Project Overhead cost = $600/ day.

In order to arrive the best project schedule, we will crash project duration such that crashing cost per
day is lower than project overhead cost per day ($600) from project economics perspective.

For crashing the project, we will assess activities on critical path for crashing starting with activity with
lowest additional cost to crash per day.

Crashing schedule will be as below:

- Among critical path activities A-B-D-E, activity E has lowest crash cost per day. So we will crash activity
E by one day (maximum possible crash). Project duration = 18-1=17 days. Crash cost = $500. Critical path
is same A-B-D-E

- Next among critical path activities, the activity B has lowest crash cost per day of $600. So we will crash
activity B by one day (maximum possible crash). Project duration = 17-1=16 days. Crash cost = $600.
Critical path is same A-B-D-E

Now, if we have to crash project duration further the activity D need to crashed however crashing cost
per day for D is $700 per day. This crashing cost is higher than saving from crashing by not incurring
project overhead cost per day $600 so economically it is not viable to crash project further.

Best schedule is to crash activity E and B by one day each so total project duration is 16 day

Total project cost = Total normal cost for all activities + Total overhead cost + Total crashing cost

Total project cost = (1200+1800+1700+1500+1900) + (600*16)+ (500+600)

Total final project cost = $18,800

Assignment 5:
a)
b)

Predecesso Activity
Activity r Time ES EF LS LF Slack

A None 4 0 4 3 7 3

B None 6 0 6 0 6 0 Critical Activity

C A 2 4 6 7 9 3

D B 6 6 12 6 12 0 Critical Activity

E C,B 3 6 9 9 12 3

F C,B 3 6 9 14 17 8

G D,E 5 12 17 12 17 0 Critical Activity

ES = E of Tail Event

EF = ES + Activity Duration

LF = L of Head Event

LS = LF - Activity Duration

Slack - LS - ES

E = Earliest occurrence time for the event

L = Latest allowable time for the occurrence of event

Paths Days Duration

A-C-F 4+2+3 9

B-D-G 6+6+5 17 Critical Path

A-C-E-G 4+2+3+5 14

B-F 6+3 9
C ) The Critical path is B-D-G with estimated duration of 17 months

d) Since the deadline for project competion is 1 and half year and critical path is for 17 months which is
less than 1.5 years, hence crashing is not required.

Assignment 6:
The critical path is A-D-G-H-I as it is the longest path with duration of 19 days. We need to crash the
critical activities to crash the project and we will crash the critical activities according to their cost slope.

We can see cost slope of activity A is lowest 50/week and it has crash limit of (normal time-crash time) =
(3-2) = 1 day so we can crash project by 1 day by crashing A by 1 day. Now project duration becomes 18
days and this crashing costs $50

Next we will crash activity G by 1 day as G is second most economical activity and second largest path A-
C-F-H-I has duration of 17 days. Crashing G by 1 day will cost $120

Now both A-D-G-H-I and A-C-F-H-I have 17 days duration. We need to find lowest cost crash
combination to crash both the critical paths simultaneously

From A-D-G-H-I, only G has crash limit of 3 days left and from A-C-F-H-I, activity F is lowest and have 1
day as crash limit.

So we can crash combination G,F by 1 day which will cost 120+80 = 200 and project duration becomes
16 days

We have now consumed :

$50+$120+$200 = $370

and only left with $400-$370 = $30

Hence we can not crash anymore

So minimum project duration within allowable budget of $400 is 16 days.

Assignment 7: