PERT CPM

JASPAL SINGH

(EX IES)

Nbt

mm

of mm

mm

am

HE
MMM

may

CONTENTS

1. PROJECT

2. PERT

3. CPM

4. CRASHING

5. UPDATING

6. AON NETWORK

PROJECT

work which we do is termed

as

Any

Project

To execute the project resources are

required
Ex Manpower machine equipment

money material time

Engg deals with technology where as

project management deals with

synchronisationofthe technology with

manpower

Every project has 3 Basic objective

Project should be completed in least

time

2 Project should be completed in least

cost
Project should be completed by optimum

3
use of resources that are available

ELEMENTS OF PROJECT MANAGEMENT

There are 3 basic elements of project

management

Planning

scheduling controlling

Planning

It is the process of defining objective

of project and to identify resources

required for its completion

Scheduling

It is the process of arranging the

objective define during planning in

sequence

and allocation of resources to these

activities

Controlling

It involves execution of planning and

scheduling
Ifit there is
any deviation from original plan

also includes

rescheduling

METHODS OF PROJECT MANAGEMENT

e Ban chart Gantt chant

Activities Duration 3

A Ending

Starting

0 I 2 3 4 5 6 7

Times
Bar chart

graphical representation of
is

activity vs time

Here time durations are marked on X

ane's

Activities are marked on Y anis
Length of bar represents duration of

activity

Activities shown with the help of bar

are

Start point of ban represents starting time

of activity and end of ban represents

finish time of activity

Question

Draw a bar chart for certain

project

Activity nodays I 2
E I

Duration

I 2

Activities 2 and 3 can be done
concurrently

and both must follow Activity 1

Activity 2 must preceeds activity 4

Activity 5 can not begin untill both

activity 62 and 3 are completed

Activity and 7 can be started only

after activity 4 and 5 completed

find the project completion time

UM


Limitations of bar chart

i Lacks degree of details

ii Review of project progress Hence it is not

used as tool for controlling the project This

drawback of bar chant eliminated

by hatching the half width of the bar

upto the extent it represent project

progress

iiiActivity Inter relationship

Example Project laying of Pipeline

a Excavation 24days

b Placing the pipe line 15days

C Back

filling 9 days

ÉÉ p

O 24 39 48

Days

n Time Uncertainity

d No cost optimisation

2 Mile Stone chant

It improvement of ban chart In this

is an
case certain portion of the
activity that is

completed in terms of milestone

Milestone can be shown on drawn with

the help of arrow circle on square

Each milestone can beconsidered as an
event of main

activity

Here interrelationship between sub activities

of a particular activity is established but

different activities still not established

De 3 at

A construction of foundation

Excavation Formwork Placing Back

E F

of An filling

P B

Hemet milestone chart is event oriented

and bar chart is activity oriented

3 Linked ban chant
It is the modification of ban chant and

milestone chart in which interrelation

ship between activities is shown with the

help of links

4 Work Breakdown structure

It is the process of breaking the entire

project to be executed into no of system

subsystem components and its element

so as to simplify theenecution of project

Project

u r

System system

n

I

Subsystem

Subsystem

n t

components Components

Elements Elements

Construction of house

construction

finishing u

of foundation Interior

Construction of u

column construction

of beam stab

Construction of column

Placing of Placing of Concreting

form work rip

n t

Procurement of Bending of Binding

R If Rif of RIF

5 Network Analysis
It is graphical and logical
representation

of diff activities

It is modification of ban chant mile

stone linked chant where all the draw

back eliminate

Network are of two type

a
Activity on awww AOA Arrow
diagram

b
Activity on node Aon Precendence

fundamentals of Network

Network consist of different activities
logically and sequentially

connected

such as required for completion of

project

1 Activity an arrow network

It consist of
diagram on
activities being mark

arrows and event mark on node

Activity Actual performance of the

task is termed as activity

Ex Construction of foundation concreting

preparing for ESE creating

in class nuisance

for completion of an
activity resources

required

are

Here activity is denoted by an arrow

Tail of arrow signifies start of activity

and head of arrow signifies completion

of an activity

Length and direction of arrow has no

significance But generally they are

drawn from left to right

Description

1 2

Duration

Description A B C

tail or head event

I

Name

Types of activity

1 Serial Activity
An which can be started

activity the

only afteris completion of another
activity teamed as serial activity

A B
2 3
Say

1 y
a
t 23day day

day E 9 day

day t 5

Here activity A B C are serial activity

2 Parallel Activity

Actiwhihan be carried out

simultaneously are termed as Parallel

activity

3
t 17day

Bsd t 19day

5d

E 5 dfyd
2 5 Ed g

tggday Ead

Series activity

A B D F A C E f

Parallel activity B 11 C DII C DH E

Parallel activities independent to each

are

other

Event An event is an instant of time

which marks the start on completion

of activity
an

occurrence of an event do not required

resources
any

Example

Construction of foundation started

Construction of foundation completed
Concreting started

Concreting finished

Preparation of ESA en amination

started

Preparation of ESE en amination

completed

Here event are marked on nodes and

are represented circle square

by

rectangular

Types of

an event

e Tail event

An event which marks the starting of

an

activity

A tail event which marks the

termed
starting

of project is as initial event

Encept last event all events of network

are tail event

first tail event is initial event

2 Head event

An event which marks the completion
of an activity is termed as head event

A head event which marks the

completion

of project is termed finish event

And event

Last head event is termed as finishing

event

3 Dual Role event
Event which acts as both for different

activities is termed as dual Role event

Encept initial and end event all the

events are dual role event

NOTE

It is virtual artificial
Dummy
superficial

activity drawn in network
only it is not the part of project to

established relationship between

other activities

Since this activity is not the part of

actual project it consumes no resources

It is represented by a broken arrow

A c

1 4

B V D

Here dummy activity 2 3 indicates
that Activity D cannot be started until

activity A is finished

Dummy activity helps in establishing

the following relationship

Grammatical Relation

Mere Dummy is used to establish the

uniqueness of identity
If more than one starts from

activity

some node and terminates also at some

other node dummy is required

2 3 A

I 2 71 7 3 4

73

I 2 5 6

Logical Relationship
Dummy is used to establish the

logical relation in the network when an

activity is common to two set of

success or in such case

activity

Dummy

establishes uniqueness of activity

mmmm

Rules to draw network

1 A network will have one initial

only
event and one finish one
iBook
end

initial

event has
only outgoing ahh ow finish

event has incoming arrows

only

2 An event cannot occur until all its

incoming activities are completed

t I 2 5

day t 9 day
6

t 3 3 day g

3 day

t a

3 No
activity can start until its tail

event occurs

t 2 2

A 8day

5

day I D

t 7 E

3 day

t g

4 No event can occur more than once

hence there should be no looping error

in the network

e a

day

B I day

A
2 day 2

t day
3 today

day

day

t 9

day

5 An arrow should represent only one

activity i e two or more arrows should

not be used to represent same

activity

6
Similarly two or more should
activity arrow

not be represented by single

D f

A B C

E G

far possible curved must be

7 As as arrow

avoided

8 As

far as possible
crossing of arrows

must be avoided and can not avoided

if itmust

be done

bridging of activity

2 7 4

7

I 6

3 5

2 7 4

3 5

BRIDGE

Time flow is

from left to
right

NOTE

for development of network dummies
required to established logical

are

and grammatical relationship But it

is
difficult to identify where dummies

must be provided Hence to overcome

dummies are provided in conservative

which results redundant

unwanted

way

dummies that removed by

following

ways

1 If dummy the only activity emanating

is
from its tail event it can be removed

A B

1 s 2 3

A B

1 2

ii

11 12

A C

Ill

12

iii

Dl

C D E

C E

2 If dummy is the
only activity
terminating

at its head event it can be

removed C

B 2

DI

1 E

3
D

o R

X P

A I a

Y Da

the relation
If dummy activity establishes

ship which already existS in network can it

be removed

A B

1 2

y D A

z 4 5

A B

I 2

D E

3 4 g

4
If two or more activities emanate start

from different nodes events having

some set of predecessors activities

then

the concerned activities start from same

node

A C

i 3 7

2 a

two activities have same set

5
If or more

of successors activities which are also
having other predecessors then the

concerned

activity must terminate at

same

node

A E

B s

C E

B f

Numbering of event

Numbering of event is done by talker
son's rule as follows

1 No the initial event as one initial

event has outgoing arrows

only
Remove all the outgoing allows of

initial event This will lead to formation

of new initial event

3 Number these new initial event
sequentially

Repeat step and untill all the

events are numbered

2 S
4 7

Ba BYE

I
f

1 5

N

t

3 6

NOTE
Skip numbering in small network

no modifications are

required
numbering

is done in sequence But in big

network there frequent changes if

numbering is done in sequence huge

time will be required for removing

of events in case of modification

In such case skip numbering is adopted

Example A project consist of 10 activities

follows Draw A OA network

as

diagram and no of events as the rule

Job Immediate

B A

C A

D A

E B

f C

G D

H D

I E F G

J H Z

3 E
B

A f 6

I 2 C a I

g 8

G J

D s
M 7

s

A network
Question Draw Boa diagram for

the project

having following

activity relationship
follows D but proceeds f

C
1

C but proceeds H
follows B

3 G follows f but proceeds I

4 f follows A but proceeds I

5 D follows A

6 H and T terminates at same time

7 A and B start at same time

7
2 6 I

IG

D
g
7

B
f
n

j C
a

Question In a construction project events

havenor identified as A B C D E

A G H J K L M

1 A is start event

B Occurs after A
2

3 C succeeds B and proceeds I but re

strains the occurrence of G
after B beforeH k and restrains E

4 D occurs

5 f succeeds C proceeds

and restrain A

G E succeeds B but proceeds J

7 H proceeds t and restrains J

8 L occurs
after J but before k

9 M succeeds K draw A peat network

10 G succeeds f and proceeds J

D K M

A B O L

a r

r a

i
i N

Question The given network shows the

relationship between the

activities

P and W where P is plastering and
W is white washing done

one set

by

of lab opus

If the entire work

is to be executed in 3 different section

Draw the network for the follow

diagram

ing relationship
when P and W is available for all section

2 P is available for 1 section and w is

available for all 3 section

3 P is available for 3 section and W is

available for one section only

4 When P and W are available for one

section

only

Solution Pre Activity

Activity

P
I

Pz

Pz

Wi p

Wa P2 k

W3 Pz

P Pa P

W Wz Wz

p s
W

P2 Wa

T
P

Pre
Activity activity

Pa p

P Pat P

We P

Wa Pak P

Wz P Pa P

p Pa Pas

Wa W3

We

Activity Pre activity

Pz

Pz

W P

Wr Pat W K P

Wy P Wa Pa W P

Pr
Jw

Pz

N a
WZ

Wz

N
Activity Pre activity

Pa P

B Pat P

W P

Wa With PI P

Nz Post Wath Pa P D

W We

i
I

Pa P

Question A project consists of 3 operations

E C and B where I stand

for

excavation for one set of group C stand

for concreting by other set of group and B

stand for backfilling for another set of

group Each of 3 operation can be

completed

in 3 sections Draw a network

assuming

that completion of 1 section in an

operation

allow the beginning of neat open

ation

Solution Pre
Activity activity

Er E

E3 El

EET

CI

2 Eat Ct Be

Cz E3 Cath Ra fi C
th

B C E

B2 2 Bit Ez G R

Bz 3h B2 E3C2 Ezekiel

E Ez E3

G Cz Cz

B B2 Bz

C B

1 2 3

3 7 A B

7
a
I

p B3

I 2 q 10

5 6

Az 137 104
Cz

4 8

This network is ladded network So in this

particular network completion of project

comes out in minimum

day4 7 24 18 9

Let 24th 2
ish 3
In 51 hr

Divides the projects in 3 parts

14 ta 22hr

8 At
3hr

BI

3hr g B2

r
y fathoms22hr

E

I 2

8hr 5 Cz 6 9 s 10

8hr D 3hr

By 6hr
ID
y Ph

0
q
Me

8hr 4 8

t 30

E3

azan
876hr

gh

 PREVIOUS YEAR QUESTION

Éuestion 1which of the following

techniques belong to e
project
Time Plan
I Critical path method
2 Precedence network
analysis
3 Line of balance technique

programme chart
a Linear
a 1 2 and 3 1 2 and 4
only only
c 3 and a only 1 2 3 and 4
2019

Solution d
Techniques for project time plan
are critical path method precedence
network analysis and line of balance
technique
Linear programme chart is used
manimisation cost minimisation and
for profit
resources allocation

Question 2 The graphical representations

wherein long duration jobs are
 broken down to key segmental elements
wherein events are shown in chronological
order without attention to logical sequencing
and whenin interdependencies between the
events is not highlighted is referred to as
a CPM b Milestone chant
C GANTT chant d PERT
2019

solution b

Question 3 which one of the following

techniques is not covered in
Project Network Analysis
a Critical Path Method
b Program Evaluation and Review
Technique
c Procedure Network Analysis
d Measurement book
2020

solution d


PERT
Programme Evaluation and

Technique

It is a technique which is used for planning

scheduling and controlling the project

The most important factor in completion of

project is time involved in it which depend
upon the estimate of different activities

Time estimate for the activity can be

done by two methods

i Deterministic
approach sufficient
knowledge

about completion of
activity

2 Probabilistic approach Here not much

idea about completion time of an
activity is known

Peut follows probabilistic approach and it

is event oriented technique

In order to account for uncertain

ity

involved in completion of activity 3 time

estimate are considerable

1 Optimistic time estimate Min time required

for completion of activity in most

ideal condition

2 Pessimistic time estimate Mani mum time

required for completion of activity

in worst condition while

analysing

worst condition contigencies are not

considered

3 Most time It is the time required

likely

for completion of activity in normal

condition

Time estimate can be represented in the
form offrequency distribution curve

edistribution
Pfaq

curve

Frequency

Of
no

activity

BBB jemadar

Me

É
I I

EE
K

ay

Cir ma E

Pessimistic

NOTES

Properties

of frequency distribution curve

1

Mean time I X t Xa t Xn

Deviation Variation DIV I Xi XI

3

Variance 62 2 D E Xi X

Standard deviation r Xi x

All these are parameters of spread or

dispersion

Probability Distribution

In frequency distribution we me
analysis

behaviour but in probability

group

an the distribution
distribution we analysis

of probability values of diff all possible

outcomes

Since probability valueS varies from o to 1

its analysis is comparatively simpler

hence it is our distribution curve

EBfeeteroerf

Deuray
distribution

a
f

A probability distribution curve is plot of

function f n teamed as Probability

distribution

function w r t to time Height of which

is standauized such that area under this

curve is

unity

A j y du

Ex dn

NOTE

The ordinate of this curve for

absicca x does any

not gives probability

but function f x
Hence probability at point X is given

any

by ratio of area of curve upto that point

and total area of the curve

P x Area of curve upto x

Total area

IT dx

Fx dx
f

x dx

if P.D.ci symmetric about open it is

teamed

normal Gaussain Bell shaped curve

as

and it is not symmetric about open it is

termed as B distribution curve

Following properties of normal probability

distribution curve are significant

Limits Areal

I 36 0.15 I

o
N X 50
fo I
36 Assumptions
36 error at 3

fp

X IO 68

I 120 95 Ap to 5 30

I 36

I 30 99.7 tp to 60

BE

age time in which an activity

or mean

can be completed ITit is the time

in which 507 chance in t for completion

of an
activity

If the shapeof probability distribution

its known is expected

curve AN for activity

time can be calculated directly

But practically it is not known1 Hence

this time is computed by taking

weighted

by

te to 4than

Ip6

BE

pm Im

a
an

Central limit theorem

tell te 23 te 34 teas

2 z 4 5

there are no of activities

In a network

in series than the expected time of the

project along particular path is summation

of expected time of all the activity along

the path

Te project Steig the particular

along

path

Event time

1 Earliest Expected Event time Te

It is the minimum time in which an

event can occur

An event occur when all the activities

leading to it are completed

It is calculated by forward Pass method

12 lai Tei teij

15

TE ti
Mei
23

Fei teej 27 Imax

in j t

10 B 13 a ai
t j 29

tei 2g
am

it UM.TEi
fi g

TEJ Tei tei j man

2 Latest Allowable Occurrence time Ti

It is man time in which an event

occur without
may

delaying project

It is calculated by backward pass

method 10 7 J 12

peg
12 10

if 2
9
i j 15 9 6 3min flip

lo g g
i j g

ij tei j

j 16

Tri Tj tei
j min

Slack

It is the time
by which occurance of an
Mhm

event can be delayed without effecting

the schedule completion time of project

It is mathematical diff between latest

allowable accuranceme and earliest expected

event occur me once time

Te Te

The value of the slack can be tre O oh

ve

slack Te 15

A
If 0

S TL TE 7 O

Ti TE 7 R

ve slack indicates Te 10

1 The events are ahead

running can

of the schedule hence be delayed

by time value equal to slack without

delaying project

2 These events are termed as sub critical

event

B S
f S Slack O

TL TE D TL TE

e Slack indicates that this event is on

schedule and we can not afford the

this event
delay in the occurance of

mm
in occurance this event

as
delay of

would delay the entire project

2 These events are termed as critical event

C
If Slack O

S TL TE C O

TL TE Te 10 day

g 7

TE 13
day

the slack indicates that this event is

running behind the schedule

These events are termed as super critical

event

Critical Path

Critical Path is the longest path in terms

of time in network in which the project

can be completed

Critical path is shortest path in terms of

time in which project can be completed

as

early as possible

Critical path is that path which joins

critical event C E for which slack is

zero

Intase a network has multiple critical

path then emphasis is made on that

critical
path whose variance on standard

deviation is more

NOTE

As per central limit theorem

variance
of any path critical path it will be

equal to sum of variance of activities

along that path or critical path

Question The expected time of completion

in days for each activities of

network is shown in the fig

Determine

the critical path if scheduled

completion time is 21 days

te 6

2 y

te te

tess te 6

n 3
f

te te
s

te te
te 3 test

z a 8

E
E Fffftd

Critical path 1 3 5 7 8 9 722

days Te

Question The network for a certain

project is given find its critical

path

to tm to tr

Activity 6 8 11 8.167

1 2

1 3 3 7 9 6.67

1 4 5 7 10 7.17

2 7 8 10 12 10

2 6 4 8 12 8

3 6 8 10 12 10

4 5 4 6 8 6

5 6 3 3 6 4.63

7 8 5 8 12 8.17

6 8 7 10 15 10.33

Critical path 1 4 5 6 8

TE 28.33

521 TE 6.17

2
10 7 20.16

8.17

8 TE 18

10
8

6
67,3
6 10.37

I a TL 18
TE 228.3

T 4.83620

1228.33

2 07.17 34 13.17520

7 0
7.17
635 T
TL 213.17

820 TE

S O

II 17

Probability of completion of project

so

P Tsi Area TEL Area CTE TSI

Area Ts

0 5 Area TE Tsi

P TSI X Area LTE TSI

P TS 2 Area Tsa

Area TE Area T2 Tr

5 Area TE TS 2

P Tsz 2 Area TE TS 2

The

probability of completion of the project

in schedule time is computed as follows

STEP

Determine standard deviation of project

along critical path Use central limit

theorem

im i

r
fue of standard deviation

of critical activity on variance

STEP

Determine Ts Te and expressed it in

terms of parameter i e probability

factor on normal deviate L

I Ts and this 2 is linked

ITE with

I
probability

I 0 2

Probability 50 84 19 97.79 99.9 7

L I 2 3

15.9 2.3 0.1

Question forgiven project determine

critical path standard deviation

compute thetimedunation that will provide

90 probability of its completion in time

Also compute probability of completion of

project in 30 days

Activity to ten tp te r
HEY

1 2 2 5 8 5 I

2 3 8 11 20 12 4

2 4 4 7 16 8

2 5 4 9 20 10

3 4 O O O O O

3 7 3 5 13 6

9 6 7 10 13 10 I

5 6 3 7 17 8

6 7 2 3 10 4 1.77

7 8 2 4 6 4 0.44

72 31

5517 8

Tu 31

y
I

8 8

T
9 6

TEES

T D FEI't g
TE 227 1235
2 27 520

5 0 8

TE 19

Te 19

Critical Path 1 2 3 4 6 7 8

6 922 6223 6324 6425 6627 672 8

Iii r I a OH 1.77 0 44

6 2.86

I 84.1 95 p

motor
97.7 1 2

2 2 1 X 95.84

84.1 97.7

I 1.80 I

1 80I Ts 35

2 86

Ts 40.15 41 days

iv Ts 30 I

days III

30 35

2 86

1.74

L P

I 15 9 P 15.9 15.9 2.3

X

2 2 I 2 75

P 5.79

BEBEE

BEE

pm

ot3PBA

me

CPM Central Path Method

This technique is developed in parallel with PERT

but isdifference in following ways

PERT CPM

It is event It is an

an
oriented
activity
oriented network

It is based upon Deterministic

probabilistic approach approach

Here 3 time estimates One time estimate is

are made
for each made for each

activity activity

Each activity follows follows normal

B distribution distribution

It is used in research It is used in repeti

and development tire type project

type project space

manufacturing
industries

Cost of the project is Here cost is not

directly dependent directly dependent

upon time of project upon time

OP M Analysis

t Even t time Te Te start and finish

time of activity

Start and finish time of Activity

1 Earliest start time It is the earliest

tech an
activity can be

start

An activity can start only when its tail

event occur Hence EST of an

activity is

equal to Te
of its tail event

2 Earliest finish time LEFT It is the

earliest time in which an
activity

can be start An activity finish in

can

earliest time it start at its earliest

if

time

EFT EST tij

NOTE Earliest finish time of an

is not to
activity
head event in
equal

general

3 Latest finish time LAT It is the

latest time in which an activity

can be finished without ma

effecting

the schedule completion time of

project

An activity can be finished latest at its

latest occurance time of head event

LF T Tj

4 Latest start time It is the latest time

in which activity can start with

out ma
effecting the completion time of

If an
project
start at its latest time

activity

hence also finish at its latest time

LST t t ij L FT

LST Lf T t ij

NOTE LST of an activity is not equal to

Tj Latest all occurrence time of

its tail event

Activity name EST Eft

Ti LST Lf T

Question Calculate the activity dine

Te 5 t 13

g bij 10
6

Te f T 15

EST 5 EFT EST t ti

j 5 HO 15

Lf T tij 15 LST Lf T Aj 15 10 5

EFT EST LF T LST

15 5 15 5

Float It is the time which

by starting
and finishing of an activity can be

delayed without maeffecting the schedule

completion time of project

It is analogous to slack in peut

floats are of following type

1 Total float It is the excess of man time

available over
activity duration

TE 5 TE 12

2 y

T 6 7 17

5 6 7 8 9 10 11 12 13 14 15 1617

e
Mantimeavailabletoractivity

t 2

A 15 5 10
days

ere

te

EST 5 f 17 7 10
days

441g

Manimum time available foran activity

when it starts its earliest time and

finishes at latest time

Fr Ti Te

tij

FT LFT EST tij

FT LST EST

FT LFT EFT

Total float of concern m

activity effects the

totalfloat of both predecessor and successor

activity

2 free It is the excess of time

float

available over activity duration

The concept of free float is on basis of fact

that each event occur at its earliest

time

5 6 7 8 9 10 11 12 13 14 15 16 17

I I
Min time available
l

le fr
k

I activities
free flood 7 2

I 5 days
I

ie Time available for activities

Ff Tej Tai tij

FT Ti j LTE i tij

Tei tij Tj A

Ff Tej Tj Fr

Fe Tij Tej

Ff Total float Head

Fr Sj

event slack

free float of concerned activity affects the

total float of predecessoractivity but does

effect the total float of successor

not ma

activity

Independent float It is the excess of

min time available over the

activity duration

An activity has minimum time for its

completion when its tail event occurs at

latest time and head event occurs at

earliest time

FI CTE j Tai tip

Ff TE j Tei Aj

Tej ti j Fft Tei

Fs Ff t TEI TI

FI Ff LT Li Tei Ff Si

FI Ff Tail event slack

Independent float of concerned activity

effect the total float of

does not or

predecessors
and successors activity

Interfering float It is another name of

head event slack

F If Tj Tej

FT Ff

Analysis in CPM

To do the
analysis in CPM critical path

is required which is based upon critical

activity that found using total float as

follows

1 If total float fr O float is

If total

negative for an activity it is

termed as super critical activity

Such activity are those which runs beyond

the schedule

Resource allocated to these activities

are less than required

2
Ff Total float fr 0 If for any

activity total float is such

zero
are termed critical
activity

activity

These are the activity which are

running

on schedule

The resources allocated to these activities

are optimum

3
If total float fr 0 Activities for which

total float is we are termed as

sub critical activities

These are the activities which run ahead

of schedule

Resource allocated to these activities are

more than optimum

Critical Path As it is the time wise

longest path network in which

project can be complete

It is the path which join critical activities

Question Draw the network for following

project and indicates event

times and critical path also find the

project duration and floats for all

the activities

Activity Duration Depends upon

A 2

B 2 A

C 2 F

D 6 Ay

E 6 D G H

f 1 A

G I f

H 2 G L

K 5 A

L 3 F K

Activity Duration Fr Fr Ft ti

A 2 O O O O

B 2 O O O O

C 2 O O O O

D G O O O O

E 6 O O O O

A 1 I 0 0 1

G I 2 0 1 2

H 2 O O O O

K 5 0 0 0 0

L 3 O O O O

Er E

KMS D4 E
pg
E 05 s EN

Ipay

E E
Da D

E
M E
E

my
y C B

B g g

EST EFT

Encept F and G all

1ST LAT activities are critical

Critical Path A K L H E

A B C D E

Question With a view of improving the

speed of implementation each

A B C D are split into 3 equal

segments maintaining appropriate

interrelationship between A and each

of these segments What will be the

standard deviation of the modified

project duration after segmentation

Activity

A B

8,3 914,5
1243
18,17

solution

Ag I I 13 I I

3 3 B
13 44 a

a 1
D2

Dirt

A BI G DI D Dz Dz

6B rBPtrBEtrB

4.5

2.6

Go 1.73

6 132 2.62 1.732 31.87

4.6

 PREVIOUS YEAR QUESTION

FEEDS

Badly

maze

a a


I go.jp

CRASHmy

Crashing

for projectg two most important elements

any
are time and

cost

The project cost depends on the time but

not linearly and directly hence to find

the min cost and optimum time project

cost is to be studied

Total cost of the project consist of following

components

1 Indirect cost

2 Direct cost

Project Cost

H M

Indirect cost Direct cost

I n

Overhead Outage loss

1 In direct Cost It is that cost on expenses

which can not be computed

individually

for activity
an But can be

found for the

entire project

This cost increases directly with time

This is further classified as

Oven heads Outage loss

Salary given to Panellies

re a taxes

employees it establishment charges

increases
linearly maintanence changes

with time It increases non

linearly
with time

Total

indirect I

flowage I

Total

indirect loss

cost

lovely

heads

I I I
l 1

Time

2 Direct Cost

It is the cost of project that can be

controlled for each activity separately

Ex Machine manpower and material

This direct cost decrease with increase in

time

co

Direct

cost

a
i
i

Cn normal cost

It is the direct to Time tn

cost of an activity associated with

normal time tn

Cc Crash cost

It is the direct cost of an activity

associated
with crash time

Crash time is min time required for the

completion of an activity

Even if we deploy infinite resources

not be completed in time

activity cancrash

less than time

for simplicity in computation we assume

variation of D s to be linear with time

Cost slope

n
Ca

pl

Direct

cost Actuate

G t lol i

slope of D.C 1

curve assuming

it to be linear te time th

Ocs Co en

tn to

Ocs 10000 5000

10 5

1000 Rs

6.6 day
Hence it signifies increase in direct

cost per unit decrease in time of activity

E Too

It g

it

ip p
as

Cn 5000 Tc 5 day I day Tn 10

day

Total cost Indirect cost t Direct cost I

e Indirect

cost

cost

1 Direct cost

t optimum

Time

Crashing

The process of reduction of total project

duration along critical path to obtain

min cost is termed as Crashing

It being carried out as follows

a Draw the network diagram

b Perform the analysis to find critical

path

c Indicate the critical path along the

network time scale

d find the cost slope of all activity

e start
washing the network along the

critical path starting with those having

least cross slope

f while doing sog some non critical activity

also become critical leading to

may
the parallel critical path In such case

MI
I mushing
c is done upto an extent

activity are crashed

fully

Question The following information is

available about various activities

Actiityationootstoot

1 3 8 5000 7 8000

2 3 5 8000 3 10000

overhead cost 2000ns Determine

min cost and optimum time

Ghgdg TE 4

7 4

FT O 413 72 513
4 0

I 33

817

TE O
FT I TE 9
Tao 9

Te

tn 9 week

IDC 2000 9 18000

0 I 2 3 4 5 6 7 8 9

413 2
513

3m

817

C S 1 2 3000

1 3 3000

2 3 1000

D C 4000 5000 8000

17000 Rs

Total Cost 18000 17000

35000 Rs

2 first Aage
Slope Crashing

2 3 at 1 week

Tc 8 week

0 I 2 3 4 5 6 7 8 9

413 413

y 2 3

it

817

to 8 Week

16000 RS
IDC

DC 17000 HOO 0 1

18000 RS

TotBoost
TC 39000 RS

3 Second stage crashing

2 3 11 1 3 I week

0 I 2 3 4 5 6 7

4 3 3 3

I 77 2 7 73

7 7
7

Tc 7 week

IDC 7 2000 14000 RS

DC 18000 3000 1000

Total cost
DRABBER 22000 RS
Total cost 36000 Rs

36k p

35 K L

Total I
o
1

cost I 1

344 4

I 1

min m 1 I 1

cost Cm I I 1
I 1 I

Time
7
optimum9

time

Question Thetollowing table gives the

data for the duration and cost

for each activity of a project network

shown in fig The indirect cost of project is

Rs 3000 week Determine the optimum time

and minimum cost of project

Activity th Cn te Ce C s

1 2 6 7000 3 14500 2500

1 3 8 4000 5 8500 1500

2 3h 4 6000 1 4000 1000

2 9 5 8000 3 15000 3500

3 4K 5 5000 3 11000 3000

2
y

613 513

I 44

44

315 513

solution 6 6
MAT 67

TEE

2
Ft 4

613

513

act a

i
I 7
FEI

TE O

TL 20 N

815 513

2 3

FT FT O

TE 10

TL 10

8 9 10 11 12 13 14 15

01 23 4 5 67

513

613 411 513

s 2 3 s a

815

tn 15

days

IDC 3000 15

45000 RS

DC 7000 600075000 4000 8000

30000

TotMTc
ust 750000

1 first stage Crashing

2 3 at 2 week

Tc 13 week

IDC 3000 13 39000 Rs

DC 30000 1000 2

32000 RS

To toast
Tc 71000
0 I 2 3 4 5 6 7 8 9 10 11 12 13

513

613 211 513

1 2 3 7 a

815

2 Second stage crashing

2 3 11 1 3 25 K

1 2 11 1 3 4K

3 4 3K

Crushing of 2 3111 3 at 1 week

Tc 12 week

IDC 3000 12 36000 RS

DC 32000 2500

34500

TotalBoast
Tc 70500

0 I 2 3 4 5 6 7 8 9 10 11 12

513

613 14 513

1 12 3 a

715 y

3 Third stage

crashing
1 2 11 1 3

211 1 3 X
3

3 4

3 4 at week Tc 11 weeks

0 I 2 3 4 5 6 7 8 9 10 11

5 3

1 N

1 613 21111 3 913 q

715

IDC 3000 11

33000

DC 34500 3000 1

37500

TC 70500 Rs

4 fourth stage crashing

1 2 11 1 3 4K

2 4 11 3 4 6.5 U

1 2 11 1 3 at 2 week To 9 weeks

0 1 2 3 4 5 6 7 8 9

513

413 2141I 3
413

1 s q

515

21 3000 9227600

DC 37500 4000 2

45500

TC 72500

5 fifth stage

2 4 11 3 4 at 1 week

0 I 2 3 4 5 6 7 8

413

413 111

2 3 4

1 515 g
p

Tc 24000

DC 52000 Rs

Tc 75000 RS

76k

472.5 J

Time

cost 71.5

70.5

8 9 11 12 13 15

Time

Question Determine the minimum cost

and optimum duration for

project network The duration and cost of

each activity of the project is given in

the following table the indirect cost

of project is Rs 800 day

Activity th Cn Cocks CskS

catty

days day

A B 2 10000 2 10000 0

A C 7 5000 3 9000 1000

B C 6 3000 3 4200 400

B D 5 2000 4 2500 500

C D O O O O O

C E 9 6000 4 9000 600

D f 11 6000 6 10000 800

E f 6 7000 3 9100 700

FEZ EYE

TE

7 12

D B D

212 FT A TE 28
M3

613 11 6 TL 23

77 0

A f

713 r s
p o
47 0

T O C 94 E

f D

Tf
MATT p FE FEI

A BC E F Critical Path

0 1 2 3 45 6 7 8 9 10 11 12 13 14 15 16 17

18 1920 2 22 23

713

A 212 613
C
919 I
61131
I

B a

514 1116

th 23

days

IDC 800 23

18900 RS

Dc 39000 RS

7ng 57400 Rs

First Stage Crashing

BC at week

0 I 2 3 4 5 6 78 9 10 11 1213 14 15 16

17 18 19 20 2 22

713

AlI 212 5131

I
d 314 613

B s a p

514 D
1116

22

tc day S

IDC 17600 RS

DC 39000 400

39400 RS

Tc
m 57000 Rs

second stage crashing es

CE at 4 AC 11 BC 1900

days

Tc 13 weeks CE 600

18

IDC 800 Ef 700

14400 RS

DC 39400 600 4

41800 Rs

Total Cost 56200 Rs

O 1 2 3 4 5 67 8 9 10 11 12 13 14 15

16 17 18

7 3

212
B 513 514 613

A
g s
C
s
I s

514
g
11 6
y

Third stage crashing es

CE II Df at 1 days AC II BC 11 BD 1900

CE II Df 1400

Ef 11 DF 1500

0 I 2 3 4 5 67 8 9 10 11 12 13 14 15

16 17

7 3

A
212
B
613
i C
414
s A
613

I
a

514
t 1016

to 17

days

IDC 17 800

13600 RS

DC 41800 1406so X 1 93200 RS

Total cost 56800 Rs

fourth Stage crashing es

Ef 11 Df at 3 ACH BCI BD 1900

days

Ef II DF 1500

0 I 23 4 56 7 8 9 10 11 12 13 14

713

212 413 414 313

A s B s C s p p

519 716

to 14 days

IDC 300 14

11200 RS

DC 43200 1500 3

47700 RS

Total cost 58900 Rs

fifth stage crashing

ACI BCH BD Atl

0 I 2 3 4 5 67
days
8 9 10 11 12 13

6 3

1
414 313

A 212 s B 413
s
C s E p

414 1016

I D

Tc 13 days

IDC 13 800

10400 RS

DC 47700 1900

49600 RS

Total cost 60000 Rs

To 18

days

Tmin 56200 RS

 PREVIOUS YEAR QUESTION

st

ND

Ito

and

Updating

During the execution of the projectgchangeS

be observed in the duration of

may

activities i.e it
may be running ahead of

schedule or beyond
mas schedule

The process of in cooperating these changes

in network is termed as updating

It is done whenever there is

in activity
major change

It is done when there is change in critical

activity

No activity is added or deleted during

updating

Critical path and critical activities and

project duration may change during

updating

for smaller project updating is more

frequent than bigger project

Data required for updating is as follows

A Original network

B Time computation

c Time at which updating is done

D New information about activity

the network of project

Question fig shows

which is to be updated at the end

of 12days the following condition

exist at time of updating

a
Activity 1 4 was completed as originally

planned
Activity 1 3 was executed more rapidly

than schedule and took 8

originally
its

days for completion

c
Activity 3 4 commenced the

following
completion of Activity 1 3 and was

finished
at the end of nth day

d Activity 4 5 was commenced following

the completion of activity 3 4 and still

required 6 more
day 1

e Completion of activity 2 was

delayed

drastically and it still requires to more

10 days for its completion

f Activity 2 7 will commence following

completion of activity 1 2 and will

require

9 days for it completion

g The time required to perform activity 5

8 has been revised to 10 days instead

of 6 days

b No other activity have been started and

original time of these activity still hold

good Update the network and time

revised critical path

2 7

f g

q t 3

8 7 t 6
ptg

8 5
a g

9
4

8 10
3
at 5

3 6

TL 18 TE 23

My 8
TE

72 24

7 10
t 6 y
2

FT 10

MAMA
7 20 12 1 FT I

yes t 5
TE 13 TE 20
5,4

TL 20

t t 5 to
1

FE 8 v0 t 3 O TE 29

o
17 0
y Y É Taza
M

j FT O

TE 10 3 G TE 24

72 10 71 29

Critical path 3 4 5 6 8
1

New Critical path 1 2 7 8

it
ME

TL

Ito go

TL 12 i g
7
82218
5

FE 3

TE 12

TL 20 FT 8 I

0
9 8

I 5 In 9

a 7 26 9
O 4 71

F 28 N 5

F 8
F 9

TE o FE 3

Question

E Ii TEEMM

0 3
2
y

Fly 5 FT 20

FEI A 0
JEEZ

FT 4 4

8 fi a at

FT'd AT
Tf L

pg Fal

Eet I
update network after todays

1 Activity 1 2,1 3,1 4 1 4 have been

a 5
completed
still

2
Activity running required 6
more days

3 Activity 4 6
running still required 6 more

days
4 3 6,4 6

running still required i more

days

5 Otheractivity have not commenced and

original predicted duration is right

5 7

encept activity 5 7 Activity required

3 days if required 5 days

Solution
g

to

My Ms
Fe

2 5

Ft89 7 FT 3

FT an 369

10
TE
37

I 4 FE 4 8

FT O
TE10

TEI BETO É

y
I 3 Boa
T 10
9 6

Ft 5

TE 10

TL 15 FEI

Critical path 1 4 6 7

Resource Allocation Resource is mama

the physical

variable required for completion of

an activity on
project

Ex Man power machine material time

Allocation of these resources to these

am

activities
is done during scheduling phase

only by any of the following method

a Resource Smoothing
e In this case dem

and of the resources is made

more or less uniform throughout the

duration of project It is achieved by

delaying starting or finishing of the

activities by their available float

In this case critical activity critical

path project duration does not change

Here availability of resources is considered

to be limited

Question 1 Determine the aggregate

resource
requirement period by period
for the network given below Ithe f ig

over the arrow indicate requirement

of man son and f ig below the arrow

indicate the duration of the activities

for the project

35

C 2
a
H 2

to E 8

t
614
AG

1 2
D4 g 6 76

gB f d

solution

is
SEE

7 a

FT 4 F L

com2
Tf

g
F D 2 FT 6

7
TE 14
FEI

TE 3

T 5 7 14 TE 3

TE 8 KRAB
72 13

TL B

Timeldays Activity Mason

1 A B C 8

2 A B C 8

3 A B C 8

4 A B C 8

5 A B C

6 B C D E 11

7 B C D E 11

8 B C D E 11

9 C D E F 12

10 C D E F 12

11 D E F 9

12 D E F 9

13 D E f 9

14 D F 7

15 F G H 10

16 F G H 10

17 f GH 10

18 G H 6

19 G H 6

20 GH

21 H 2

22 H 2

12 11 12

10

10 9

g 7

I 6

É4

61234 56789 W 11 12 13 1415 16 17181920422

Time

In between 6 17 Resource
requirement is
B C D E f G H

high
F

G
delay by 52days

delay by days

Time Activity Mason

1 B C
A 8

2 A B C 8

3 A B C 8

4 A B C 8

5 A B C 8

6 B C D E 11

7 B C D E 11

8 B C D E 11

9 C DE 8

10 C D E 8

11 DE 5

12 D E 5

13 DE 5

14 DF 7

15 FH 6

16 F H 6

17 F G H 10

18 F G H 10

19 F G H 10

20 F G H 10

21 f Ge H 10

22 F G H 10

12

10

g 8

a y

0 1 2 3 4 56 7 8 9 10 11 12 13 14 1 516 17 1819 20 2 22

Time

levelling In
b Resource resource

levelling

activities are reschedule in

such a that the maximum

of
way demand
the resources become less than

the availability of resources

In this case critical activities critical path

project duration may get changed

during

levelling

Question Consider the network shown below

the requirement of labour for

each of the activities has been show

in bracket over the arrow and time

duration below the arrow

Level out the requirement of resources if

the manimum number of labours on

available are 7
any day only

7 H 2

A 4
C 10 11

I 4 f 2 6 215
3
37

B 2 3
g D Ga z

4
ME 6
z 5

Solution i sq
It

Tf 7
MAT

Tf
MEET 4
H2
Aa

yoga C

f fog

TEY
4
Tf O
my 6,157

FEI B 2 DBaye
TF D
Tug
G E
O Tp5

Tp
MMM

EG 5

a s

IE IE

Critical Path 1 3 4 6 7

Time Activity Resources

1 A B 6

2 A B 6

3 A B G

4 A B 6

5 B HC 4

6 B HC 4

7 BHC 4

8 BHC 4

9 D H E 11

10 DH E 11

11 DH E 11

12 D H G 9

13 H f G 8

14 H f 6 8

15 Fg H 4

16 f 2

17 f 2

18 f 2

19 f 2

20 1 5

21 1 5

22 I 5

12
11

10 9

a 8

8 O 6 5

6 a

2 2

0 I 23 4 5 6 78 9 10 11 1213141516 1718 1920 2 22

Time Days s

Activities in between 8 14

H F G D E

E G H
E and G

Delay activity by 5
day by 5

days

Time Activity Resources

1 AB 6

2 AB 6

AB 6

4 AgB 6

5 B g C gH 4

6 B C H 4

7 B C H 4

8 Bg CgH 4

9 D gH 5

11 D gH 5

12 D g H 5

13 F g H 4

14 F g E
H 10

15 Fg EgH 10

16 f g E 8

17 F g G 6

18 F 6 6

19 F G 6

so I 5

21 1 5

22 I 5

No advantages drive by delaying activity

E and G

So now delay activity H by 7 day and G

by day

Time Resources

1
Activity
AB 6
g

2 Ag B 6

3 A gB 6

4 Bg A 6

5 Bg C 2

6 Bg C 2

7 B g C 2

8 Bg C 2

9 Dg E 9

10 Dg E 9

11 Dg E 9

12 Dg H 5

13 H g f 4

14 Hg f 4

15 Fg H g6 8

16 F gHgG 8

17 F g H 6 8

18 F g H 4

19 F g H 4

20 1 7

21 I g H 7

22 I g H a

I 6

O 4

0 I 2 3 45 67 8 9 10 111213 1415161718 19 20 4 22

Time Days s

9 17 duration of no critical activity

increase
by doing of demand decrease

9 17 DE F G H Already delayed

Activity duration Already delayed

of E can be increased by 2
5

by day

E s

3 day e 6 labour duration of

j

6 e 3 labour E 6

day s day

3
day a a labour Duration of G
4 3 labour 4

day day

critical Activity 0
4 3 labour Duration of activity

days
6 2 labour D I6

day day

Time Activity Resources

A g B 6

A g B 6

3 A g B 6

4 B g C 6

5 B g C 2

6 B g C 2

7 B g C 2

8 D g E 2

9 D g E 6

10 D g E 6

11 D g E 6

12 D gH g E 8

13 H gF g E g D 7

14 H 3 F g E g DA 7

15 F iHg G 7

16 F H gG 7

17 g g G
FH 7

18 Fg HgG 4

19 FH
g 4

20 I H 7

21 I H 7

22 I H 7

 PREVIOUS YEAR QUESTION

ELSTREE

AON Activity on node network diagram or

Precedence
diagram
In these network diagram activities are
marked nodes and there is no place
event
for

Here arrows indicates the relationship

between the activities hence it is also
termed
as precedence Interdependence
diagram
Here there is no requirement of dummy
hence it is simpler to analyse

This diagram is self enplantory self

sufficient
Here representation of activities on node is
done as follows

EST Activity name EFT

LST Duration Act number LFT
 NOTE If more than one
activity starts from
m
initial event isa no a network than a
DEBUT activity is used in AON network

Similarly If more than one activity terminate

at finish event in AOA network then FINISH Ectivity
Act is used in AON network
Pta
for eq
AOA AOA
7
A p
B
a I 10

A ON AON
A p

I s B ff
c a
i ii
 AOA AON

iii A B
A B

T B
B
A
in A

A
A

V C
7 C
B

B
ui A B

I
C D

AOA

A B

C N D
AON

Question Thenetwork of a certain project is shown in

fig with the estimated durations of various
activities Draw thecorresponding Aon network and
determine
a Earliest and latest activity line
me
b Total and free float of activities
c Critical Path
 5 15
A 12
H
ga 22
5 4 g

3 7
12
G 16
a

Do I 8 B 9
20
J
2 22
for
na

3 f g

9
as
It
0 8 8
1 08 a q Ey q k
622
 TE5
If
2
I
Fff
If 97 16
pp
A
ft 7
TL
egg
5 Fff
Gx egg
g
22
JE
ftp.go

off 02
IfF 3 Ff 0
s
6
f
Tff
a
11
g
71 22
I 7 ft
g TE 8 FFDa Fed f
Feel s
f D
E FA O
z f
Ff O
7
na
FEI IE 6

Question Three act f G Hare to be

performed
in said sequence and
for the
whole stretch of the project needs 15
a ladder
21,27 days represent
pBNBEvely
If
network is adopted with one third of
each activity as the laddered activity the
saving in total project time would be
a 15
d 21
38
 TE 63
I 15 2 9 3 1794

Solution I I AI
f Fa Fz
G Ga 63
Hi H2 Hz

3
TEO TE TE 10
fi P2

G 7
I
It 573
If
19 Te 19
ma
42 Pg
D2
Tp 12 TE 12 103 763
I v 7 39
HI g 1

TE H TE 3
 PREVIOUSYEARQUESTION

ESE

Bat
S