PE RT and CPI\f

Growing complexities of mo der n projects h

more systematic and effective pla nni ng tech
_ave deltl
obj~ctive of optimizing th~ efficient exe cut 1
in; ~es Wi:de~ 1

In this context the pla nni ng of the project

b the Pr _the
be helpful to the ma nag em ent . The main
fo~tetwor~J:et.
P
lan nin g is tim e con trol . It ma y also be effecti of netw at1
financial con.trol. It ma y b e ~se d fior con Vely
trol and ___ Used or~
for
of various re!o~r.c~s nec ess ary for a pr_oject.
The aUo_catj0n
broken into actiVIties or wo rk con ten ts 1n
order t ProJect ~
network. [graph]. 0
draw the
various techniques are available for netw
ork
Here we shall discuss only PE RT and CPM tech
. niq plclnning,
an ReVIe .w
[Programme Evaluation d
Technique] ues.and PEbii,t\t
(Critical Pat h Method) are two network
techniqu CPM
provide a methodology for pla nni ngand con
trolling 0/as W~ich
The PERT tec hni.que wa s app hed .
to Research
proJect.
d=!eJEP.m~_!!~--...E!~j~ci;_! ~~i le the CPM tech
towards c~nstructi9 n pt:,OJ~ct. PE RT and CPM
nique was u:~
techniques are
basically time orie nte d me tho ds in the sen
se tha t they both
lead to the det erm ina tion of a tim e schedu
le for the project.
The significant difference bet we en two
techniques is that
PERT is par ticu larl y use ful for ~on-repetit
ive and ~ lex
projects in which tim e est ima tes are pro
babilistic. CPM is
utilized for rep etit ive and non-complex pro
jects in which the
time esti ma tes for the dif fere nt act ivit ies
are assumed to be
deterministic. The ma jor differences bet
ween PERT and
CPM are given below:
---:-::::----~-=-P-=E=R.:.:T:.,....,~~;·@~\{.
:.'2. :.:..f_~_ _ __ _ __:C:..:P:..:M
(i) used for neW~~rojects (i) use d for rep ~~ -- --
etitive
Projects
(ii) concerned wit h tim e (ii) concerned with tun · e an d
cost
(iii) Eve nt orie nte d (iii) act ivit y .orienteq

(iv) Non-dete}'ministic in . . . 10
. nature
(iv) determ1n1s tic
nat ure

3.34
 . .' .

,.• aJll representation:

dj•f' defines a comb'mati·on of inte~-related
I~
~ti ptoi~ttnust be executed
in a c~_!tain order before
The activities are
.~peS tb ~ can be c_o~p]~~!t e sense th at sori\e
1~~eJl~re ·
. 8 logical sequence m th
rs ar e co mpleted. l f re c~ ~ ce
~ 81ste d iJlt sta rt un til ot he ,-e.f ClL ' I. . I
iet•f csnn° of !}Ode s linked by branches Oil\ f1 ! ,
~i~e5 -~ de fines .a se t
rr1et,ot•tJiere is a flow of. so-me~ji ie~ 7!rit.s branches.
.
.
BDd ••
J
trans po rtation ne tw ~r k, c1 ~es represent nodes,
;rstd
resent branches with vehic les representing the
!JI •
te . t .ons represent
~ rep sys m, pu ~p m g . s ati
'l}''r nuid supply
rep resen t br an ch es wi th flu id representing the
II· In_
~es, pipe~niunication system,
switching points represent
essage representing
II· In _co 5 represent branches. with m
Jes, witt
airwa ys syste m , ai rp or ts re present nodes and
In
raft representing the
it11

~.n;w~present branches with airc

~. th e interdependencies and
file netwo rk repr esen ts
tivities of the project.
1
~dence relationships amqng the ac
An activity in a project is vie
wed as a pa rt of a project
It is
J:h) requiring ,time and
r.esources for its completion.
by an arrow , with its he ad indicating the
resented
nrection of progress in the p·roje
c~~ The length, shape and
lirection of the arrow has no
relation to the size of the
1itivity.
e when
An event (or) node represents a point in tim
~~e ~ctivities have been started
or completed. (i.e) tJ'he
1

end po int.s of an ac tiv ity are called events.

~mg and
~e. An_ event describes ,.start or
completion of an activity)
· ··
18
aJunction Of arrows denoting one or..., more activities .
~e difti
betw ee n the activities an d events is th at
li!Mti erenee ev ents are
~t ;s/epresent the passage of time whereas
Th une and does not consum
e any time (or) resources.
activity are_ known
ii/ la ~i ng and completion of an tively . An event
respec
~representedvent and head event
by a numbered circle.
3.35
 act ivi ty

Ta il
ev en t
head
Pr ed ec ess or act1v1 • •• A ti . . e"ent
ties: c vities which
bef?r~ . a particuIar actiVI·cy sta rts are ~~t~
1'n

called eolllp\~
activities. . Pted~~
Successor activities: Activities which
par tic ula r ac tjy i~ are called successor "'
st
activi~~ foU0~
Concurrent·ac tiv iti es: Activities which 1
can :;
concurrently or tog eth er are called con
current .c. ~~
acti\1\tie
Rules for co ns tru cti ng th e network:
s.
1. Each activity is rep res en ted by one and onl
. the ne y
1n tw ork . Th . "1s me an s t h at no single acti one-~·~
a"'"'
be rep res en ted twice in the network.
(i.e) o:y ca.
activity can connect an y two nodes.
onj
No two activities can be . identified by
the same heal
an d tai l events.
·
To en sur e the co rre ct precedence rela
tionship in ~
lietwor.k, the following qu est ion s mu st
be answered 11
every · activity is ad de d to the network.
(i) Wh at activities mu st be completed
immediately
before thi s act ivi ty ca n sta rt?
(iU Wh at act ivi ty mu st follow thi s activit
y?
(iii) ·Wh at activities mu st occur concurren
tly w~th this
· activity?
Arrows should no t cross eac h other•
· ding~
1
• Every node mu st ha ve atl ea st one activi
•
tyrprecefor ~,
and atl eas t one act ivi ty fallowing
it, except dof ~1
nodes at the ve ry be gin nin g an d at the
very en
network.
oint ~
me 1~ollows from
Ti · rrow
lef t to rig ht. All the a . direeU·~ s P
one d"tree ti··Qn • Oppos1te ·
. Arrows po int ing m
mu st be avoided. 1
Ar r d or \,e~
ows sh ould be ke · pt
str aig ht an d no t curve ·

3.3 6
 _,.dloallY ii ~ in preparing a budget.
1 / . ; ~ • are given below.
Ii
I ~
rl Job ~ .
yoreca,lml'alM
receded by

:;,,- (V ~ in advance)
. ft •cing~,al--;-es-:- ----r---:-A--_j
, preparing production A
j schedule .
costing in production C
~ pi:eparation of a budget B,D
p
~ ~ork, d' ......: .
/_' . ).r;tivitY A ha, no pl'eee mg 8\.wVlty.
//%'. A startt imJDtdiately
',9'1i1

.~ Hand C are preceded t>, A

B
r

-,, lJ II preadtd by C, but D and 8 have the 1ame

: , ., ffit, 1110".-f! ac.1.-ivity E is preceded by B and {)

0 A

3.37
 2: D raw a n etw o rk for the sill! ~
.Examp le T he V ario Ple Pto·
fo r a sh ed .
Us actiJ~et ~
erection of steelwork s
s. ·
the project are as fol1ow . •pt1•on
e~ Of
Q

Jo b d es cr 1 Pteced ed h
activity
A Erect site workshop . )
-
Fence si te
B
Bend Reinforcement
-
C A
Dig foun d at io n I
D IJ II
Fabri ca te st ee lw o rk A I
E rs
F Install concrete pilla Bl I

P la ce Reinforcement C,D
G
C on cr ete (oundation G,F
H
I Erect steelwork E

J. P ai n t steel work H,J

K Give fmishing touch J

av e no p re ce d in g activities. :. They can

Solution: A and B h
commence concurrently.

v ities C and E p re ce ded by A.

Ac?
d E can st a rt once A has finished.
(i.e.) C an
E
 • °I ' J. .. \ \·. • ,· ;•, ).'l:fl\\\\\',1 ; I ~ . ...... -
' . ' .'

G F (i.e.) H can sta rt only bot h G and

preeededbY '
.,~' . hed
1 •

l;ff fit1JS • _f_ _,,.

,,

H
•

I.' ~preceded by E but H and I hav e the sam e hea d

<l rinee J is preceded by H and
I.

preceded by J, we have the following netwo

rk.
:.1ce Kis

3.39
 p a th in N et w o rk .
' and cr it ic a l
tioJlS . .
. mpletion .
,,1119 m e ti m e fo r it s co
,, . takes so
ss ed in h o u rs , da ys , w ee k s o r an y
.{;is: tJvitY (joexb)pre · t·1mat e 1s · w ri·tt en
tin1e es
i~i~~1118y be it of time. T h e
;f 11c
t'

tw or k. A ft er th e n et w o rk h as be en
. 1i:it8 Jljent uil
.e . b
~ 1,1ve • the n
·m at es ar e w ri tt en a ove th e ar ro w ,
·., 1' ' ,,,.row in
ti
.• ~e tv • e es
ti m es an d la te st ti m es is
/ dand tun a. rliest
.:~cte of. the .e
.,.._:rifll8te h activity. h .
,. l r eac
an ev en t re p re se n ts _t e. t1 ~ e a t
.;;tJ 10 art time of
st ct ed to oc cu r a t th e ea rl ie st .
·s,tliest . expe
event is
r an ac ti v it y re p re se n ts th e .ti m e
) 8Il . tart time fo
st s~ vity can be gi n a t th e ea rl ie st. .
,: sarite . ·t · st
11e
.·ch an ac "' f · .
It y 1s i s e a r
.bl E rest finish ti m e o an act1V
th e ac ti v it y .
_! ~ e~ ~s the time re qu ir ed to p er fo rm
ac ti v it y re p re se n ts th e
an
,. ~ latest finish ti m e of p le te d w it h o u t .
:/~y which anetioacn tiofvithe project.
ty m u st be co m

j .ring the compl

m e fo r an ac ti v it y is it s la te st fi n is h
The Latest start ti '
tiv ity du ra ti on . ·
-= min us the ac
e of an ev en t ca n be d et er m in ed
\f1e: The earliest st ar t
tim
ively fr om le ft to ri g h t (i.e) fo rw a rd
L~roceeding progress
t ac co rd in g to th e fo ll ow ing ru le .
_.ij5 me bod

If only one t'1~t. y_ ·converges a t a n o d e (event), th en it

s
::Juest start .ac ti m e o f th e
~event of t:me 1:l _given by
ac
th
ti
e
vi
ea
ty
rl
d
ie
u ra
st
ti
st
o n
a
.
rt
If m o re th an
:-~activity co e activity plus
\:~0f the tave rage on an event, ca lc u la te th e ea rl ie st st a rt
~ il at h s an d ta k e th e
ro ug h al l th e p
lllulll value events th
·~ .
. e late st fini h . . . ca1cu la te d by
.o!oeeed' s tim e of t· it y 1s
:, 'llllllg Progress· an ac 1v
th e st a rt
1
ent. h
h11 'Qe ocedur 1ve1y from t e en d ev en t to
•

lc ~ Pr m e is k n o w n
1l'd p ~ used for ca lc ul at in g th is ti
\ , 18 8
 co m p le ti o n ti m e.
It is th e difference
a n d e a r\ y st a rt tin hetw
\es o f th e sa m e a c
ti v it :n th~ la~
Matheinatically, th e
bv to ta l fl o at of an &cti\r
~ it .
Yt - ·
, I T F (i - J) = (L.c;;'f - 1 ~~
EST) for activity
(i - j)
;f'ree Float: It is th e a
V m o u n t o f time an
delayed w it h o u t af a t' .
fecting the_ ~arl~ st
activity . Free float
it s e a rl y finish ti m
a rt
of a n a c ti v it y 1s th tim~
e differe any a~
~7ty
t¾ ~
1

e a
of a ll it s im m e d ia te n d th e e a rl ie st of th e earl;ce ~~~
successors. sta
(i .e ) F F [i - 11 = E rt till'itt
ST{j - k] - EFT{i - i1
ln d e p e n ~ ': n t float:
T h e amoun~ of tim
of a n a c ti v it y c a n e by which the S¼n
b e d e la y e d w it h o u
start time of ~ y im t affecting the earh,.
that the p re ce d in g m ~ ~ ia te ly foll~wing
a c ti v it y h a s finished ac~vities , assum:
ti m e . a t 1ts earliest fin~
Mathematically,
IC'n\:i -1·1 = EJ-- L -- t ·-
l V
Ei ➔ E a rl y s ta rt ti
me of a n event j
L , ➔ L a te fi n is h ti
me of a n event i
t iJ ➔ ti m e d u ra ti
o n o f a n ac ti v it y (i
~ j)
H th e result is n e
g a ti v e , it is ta k e n
N o ~ In d e p e n d e n t ~
float < F re e float <
C r it ic a l P a th Meth Total float. oi i:-
od:
~ ac ti v it ie s o f a p ro A ft e r drawing th e netwo:~ininl~
je ct , w e h a v e to .
ti m e re q u ir ed for
completion o f th e find ~ :/ for ~
we m u st fi n d th e en
lo n g e st p a th w it h ti re proJ 0 f conn~~
ac ti v it ie s th ro u g h sequence th is ~\~
th e n et w o rk . T h e
th e c ri ti c a l p a th . lo n g e st pa .
A p a th is defmed d bYbtr:
w h ic h b eg in a t th e a s a s e t of nodes ecte ~-
in it ia l node of a n et conn d end st
~ rn u.n a l _!19 d e. ~
w o rk an
1
• •
A c n ti c a l p a th d ef ti "1ue ~~ 1bj
~ l
connects th e st a rt in es a ch ai n of n ti· } 3C
• 11'- -11
a n ca e 11e rt #
A n ac -t iv ih r d e n d nodes (events O
1
 ]-,lotion dote of the entfro project.
. J1e t~()Jll . .
• 1,1 t . tJ uotwork , deter 1nu1,es the t1n1e for
f }fl •
•t The nun1nn1n1 tune to coinp1ete
l , ,~\
/ • J; t'tl o . ,
1
l 11,I J)t'<UO{, • n for th· e longes t pnt...1
:1..
.
. l.1 l t11tl • t.oka
1 i11 I) tJ,e t.10\e
/ ., 1~ ·ni·,,d' the critical path
,... . ., t~r~nu
1~uO u-
e
.,
. ' ' tl
, 111t"t
l . •i-ic~ [Jobs] and drnw a network
.~"' 1 II t11 0 :1ct1v1 , .•
' ·t :I
·w , tivity times to . be ldetern1inistic .
•;:1 t11e tJ,1c arrow repr esen ting t 1en1 .
· ·. ,iMr 8 . .
. ( 1'll- iib<>VC l
M 1ht'111 • rlies t star t time and earl iest finish
tl I
. ·te:t Similarly calc ulate 1e ates t star t
·~-·:.-1k,11~te t110
. •'•. :h !lCt.lVl ~I. ~ h t' 't
·. u t':tr ·t,est finish tin1e 1or eac ac 1v1 y.
~~J thB. 1s the 'Total sl(\l.k' for each activ ity.
1
,r,rune
· j\ltt he uctivities having no slack s, we get the
',·1ne<'t t
' l ,~
11th II d . . I . . ]
·'•·l .P·. ·h ving no slack is ca e crit1ca activ ity. \
~~ 8
,sh~ 2: If an a~~vity satis fies all the thre e cond ition s
:: ~!Jw. it is critical.
i &~T =LF1' for tail even t
: EST=LFI' for head even t
: F.:,"T of an event j - EST of an even t i = LFT of an
~ j-l.YI' of an event i = tiJ [tv ➔ dura tion of an activ ity

~ 3: ~ind the vario~s ~aths_ and thei r .dura tion s. The

ch 15 the longest m time 1s called the criti cal path .
!
~~ 7 A proJe . g has
· ct sche dulin the following
~ ...l'i, ·.
;i.lCi.Stlcs.
~~~ l -,
, ,• •. 1-3 2-4 3 7-8 8-10 9-10
~ -4 3-5 4-9 5-6 5-7 6-8
~·; ~ 1 I I 6 5 4 8 1 2 5 7
\,

·-:;,e the CPM

~e t.lie criti al
. .
calculations m a Tab ular form and
c patb. (BE , MU Ap' 90)

3.49
Solution:
The 1st nu1uber in the braces represents tl
thue of tl1e event, (node). While the 2nd ntnnl:r E~,rly ~t
Late fini~h tim.e of tJ1e event. . repr~/~
\~,q) (5,10) S \IO,IS) ~~
2. ' - ~
~{))('.(
'i:'
l ti.\ I
I t,

(o,o) l
I ::::i-

J (ls,,s)

First we calculate the Early start time of each acti\'itr

[calculations begin fro1n the start node and move to the end
node].
Since activities 1- 2 and 1 - 3 have no preceding
activities, they can start inunediately. (i.e.). They can ~tart
at time t = 0.
:. E 1 = 0
E 1 ➔ Early start tiine of the event 1.
The activity 2 - 4 is preceded by an activity 1- 2. -'
Early start time of the activity 2 - 4 is Early start, time of
activity 1- 2 (or) event 1, plus tin1e required for lhe
completion of 1 - 2
:. activity 2 - 4 can start at t = 0 + 4 -= 4.
i.e. E2=E1 +t 12 =0+4=4
E2 ➔ early start time of the event 2
t 12 ➔ duration for the activity 1 - 2 ,,
. ' 1~ .1,
Since the activity 3 - 4 is. preceded by an ac~1" 1~Y ph~
3
Early start time of 3 - 4 is Early start time ot 1
duration for the activity 1 _ 3 _

3.50
 ~1 sta rt at t = 0 + 1 = 1
g.--4 C
~¢t1 _ o+ 1 = 1
. ~c S1+t1s -
··e. ${ arlY sta rt tim e of 3 - 5 is 1, sin · ce it is
J. the e
~it!lilB!lY1__. 3
08d bY t == o+ 1 = 1
l B3:::Et+ is
g) can sta rt if bot h the act ivit ies 2 - 4
and
·ti.eJ
. (4-
AebvitY finished.
time of
,4)b8"e t time of (4 - 9) = Early sta rt
~arlY ~ of (2 - 4) =4 + 1 =5
5
duration of
,4)+ · start time of (4 - 9) = Early sta rt time
1
;\]so ear ~on of (3 - 4) = 1 + 1 = 2
_4)+ dura

i.e. E4 == 5
E• == 2
:. E=Max [5, 2] = .5, sine at node 4 we
have two
4
:iming activities.
Similarly Es = Ea + tas = 1 + 6 = 7
E6 = E5 + t56 = 7 + 4 = 11
E7 = E5 + t57 = 7 + 8 = 15
E8 = Max [E6 + t68 , E 7 + t 18]
= Max [11 + 1, 15 + 2} = 17
E9 = E4 + t49 = 5 + 5 = 10
E10 = Max [E8 + t8 _ 10, E 9 + t 9 _ 10]

·,f!t we = Max [17 + 5, 10 + 71 = 22

l
y. Here
\ ealcutaticulate Late Finish tim e of each actkivit d
•L a ons · ~t t h e end of the networ an w~ r k
be ?1°
;:t~wards. We
10
ode lO begin with the node 10. Th e activity lea ding
1be are (8 - 10), (9 - 10).
\ ~ must b ay
·ProJect. e completed by day 22 so as not to del
. :. Lt
\-1. ae finish . ..
. of activities (8 - 10) and (9 - 10) is 22
te L
l11~ 22
 Li o = late finish of
th e ev en t 10.
The activity (8 - 10)
(7 - 8), (6 - 8). ha s two
:. Late finish ti m e for Prede
bo th th e activities Ces¾i
= la te finish of (8 -
10) - tc8 - 10) == 22 - 5::::
i.e. Ls = L 10 :- ts - = 22 17
10 - 5 = 17
T he activity (9 - 10) ha
s one predecessor (
:. Late finish time of 4 -9 )
(4 - 9)
= la te finish of (9 -
10) - t9, 1o = 22 - 7 == 15
i.e. L9 = L 10 - t _ = 22
9 10 - 7 = 15
Si m ila rl y la te finish of
(5 - 7)
= la te finish of (7 -
8) - t 78 = 17 - 2 = 15
L 1 =L 8 - t 78 = 17 - 2 =
15
Late finish of (5 - 6) =
L at e finish of (6 - 8) -
t
68
= 17 -1 = 16
i.e. L 6 = L 8 - t = 17 -
68 1 = 16
L at e finish ti m e of (3
- 5)
= L at e fi ni sh ti m e of
(5 - 6) - t 66
= 1 6 - 4 = 12
Also Late finish ti m e
of (3 - 5)
= Late fi ni sh ti m e of
(5 - 7) ~ t c;1
= 15 - 8 = 7
:• L at e finish ti m e of
(5 - 6) = M in { 12, 7 }= 7, · eat
, node 5 we ha ve two sine
ou tg oi ng activities.
i.e. Er;= Min { Ls - t5a,
L1 - tr;1}
= Min { 16 - 4, 15 - 8
}= 7 . e o!
L at e finish ti m e of . un1
(4 - 9) - t.19, since (3
(3 - 4) = ~ te fi1015h
- 4) pr ec ed es (4 - 9)
:. L4 = L9 - 15 - 5 = 10
t4 9 =
L at e finish ti m e of (2 ... 9).,ti9'\
_ 4) = L at e finish of 4
since (2 - 4) pr ec ed es (
(4 _ 9)

3.52
 iSh tiJJle of (2 - 4) = 15 - 5 = 10
ta (itl
· tJ .. 10
: t_l L, --. of (1 - 3) = Min [lat e finish . time of
r111isb finish time of (3 - 4) - t 34l
);: . Jate
-1,t~ L t }
.: : : Min {L5 - t3s, 4 - :u
, l·i
:,c• w::: Min { 7- 6, 10 - 1} = 1
tim e of
. h tirne of (1 - 2) = lat e fin ish
!.JC~ fin:ce 1-2 precedes 2-4.
, f ~ t241 S

~e.l iz ==L~ - t24 = 10 - 1 = 9

:in:illY £1= Min { L3 - t13, L2 - t12}

= Min { 1 - 1, 9 - 4 }= 0

S.:'i we have the following tab ula r form.

EFT LST LFT SLA CK
~ Duration EST . t:81 '-E ST

0 4(0 + 4) 5(9 -4) . 9 5

:-2 4
I-3 1 0 1(0 + 1) 0(1 - 1) 1 0
• I
1 4 5(4 + 1)9(1 0-1 ) 10 5
1 1 2( 1 + 1) 9( 10 - 1) 10 8
6 1 7(1 + 6) 1(7 - 6) 7 0
~-9 15 5
5 5 10(5 + 5) 10(15 - 5)
4 7 11(7 + 4) 12(16 - 4) 16 5
i-7 8 7 15(7 + 8) 7(15 - 8) 15 0
J-8
.1-8 1 11 12(11 + 1) 16(17 - 1) 17 _, 5
2 17 0
15 17(15 + 2) 15( 17 - 2)
5 22 0
17 22 (17 + 5) 17 (22 - 5)
10 17 (10 + 7) 15(22 - 7) 22 5
1
·, ~ OtaJ
slack ·
5, 5- 7,
· , ¾d 8- 10lSlizero for the act ivit ies 1- 3, 3-
· ence the y are crit ica l act ivit ies .
3.53
 C~~ ;a lll lE
~~

. -L~'j
.-. C..,...._1< D
c~~
-.
= 1 - ,._, - ·'.> -
ri - -
J -
~
-::. - 10
n_
C _
;:-.:. __
~t-:: m ,:2z..--:i-,_._
--_. = e......., _....... -{' ........
~-.-:--
~-::-..... ,_.......~
~ r3J ..;i~
'l.L'l .U a~
- Jn
,....:
• .J,

E:,7" an d L FI

22-..22~
~ of. j - ES T of i : an«J LF T
r;i j - LF T r.;: !:
£,-;,7 -:: ~ - £5 7 of i = 1 - <J
=LF T <;f 8 - L? l :: : =-
LI T ~ - ES T ,;,-! 3 ='i - 1 =~
= LF T r:,: .5 - LY I :-: -: =:":
£ S7 :t. ; - £$ 7 ~ 5 = L5
- -; =,3 =LI T r,-: 7 - :_ y: 1: :

~~ ... :- 2 ~- -
,

~~~~X­ 2 ~
i -~
£,'')
~-" ~
'2 -5
'?
3 - -' 2 - S
?
:
"
- .J

•~ -;, ., 3 7
 following
~-~!!l the network given ~bov~, we hav e the
. . .
·..-'r·;s.rt time and Late ~1 sh time. ivi
;... i ,== (i.e.) Early start time of
an act ty O- 1 1s 0.
0
=·=Eo+to1= 0 + 2 = 2
isr1y start time of 1- 2 and 1- 3 is 2J
::=E i+t12 = 2 + 8 = 10
:·. Early start time of 2 - 4 and 2 - 5 is
10, since both
(i.e.) beginning
:: activities have the .same ·he ad event.

E:=E1+t13 =2 + 10= 12
·-Early start time of 3 - 4 and 3 - 6 is
12].
+3 }= 16
1 21
=Max {E2+t24,Ea+t34 }=Max{ 10 +6 , 12
ivities.
7:~- · at the
node E4, we have two incoming act
·- ·J start time of 4 - 7 is 16]
.
E--E +t25 == 10 + 3 == 13
1- 2
:·. Early 8tart .
time of 5 - 7 is 13]
e·-E
(, - 3+t35 :: 12 + 7 == 19
,.-. Earl sta
n y rt time of 6 - 7 is 19]
~-- Max \
I~ E4 + t47, E5 + t57, E6 + t67}.
-~ I
'. ;~ at l 16 + 5, 13 + 2, 19 + 8 } = 27
we caicula
te LFT of eac h act ivit y.
3.55
 L 7 = E 1 = 27 [:. LFT of 4- 7, 5 - 7, 6- 7 is
.]
LG =L7 - t 67 = 27 - 8 = 19 27
[:. LF T of a·- 6 is 19)
L5 = L1 - t 51 = 27 - 2 = 25
[:. LF T of 2 - 5 is 25)
L 4 = L 1 - t 47 = 27 - 5 = 22
[:. LF T of 2 - 4 and 3 - 4 is 22]
L 3 = Min {l~ - ta4, L6 - ta6 }
= Min { 22 - 3, 19 - 7 }= 12
[:. LF T of 1- 3 is 12]
L 2 = Min {L 4 - t24 , L 5 - t }
25
= Mi n { 22 - 6, 25 - 3 } = 16
[:. LF T of 1- 2 is 16]
L 1 = Min { L 2 - t 12 , L - t }
3 13
=Min { 16 - 8, 12 - 10 }=2
[:. LF T of 0- 1 is 2] ~
L 0 =L 1 - t 01 = 2 - 2 = 0
Thus we hav e the following Tab ula r fo~
c lL
Act ivit y EST
EFT
-
LST LFT Total Free Indep~

}'~· . i ;-.
0
~ - 2...(0 + 2)
._!9,, (2 + 8)
0 (!- 2) 2 ~o ·O ---
Flo at Float F101i
0
0
&.(16 - 8) 16 6 o_,
1-~ ~ ~
J .

lg_(2+ 10) 2 (12 - 10) 0 0

12 0

;1: . 1(!
1d
1~ (10 +6) . 16 (22 - 6)
13 (10 + 3) 2_2 (25 - 3)
22
25
6 0
0.
.II-6
-6
(a ~ r
12 . 12
1
I . ' I \
imx 12+ 3) 19 (22 - 3) 22 7 1
3-6 ·-.
~

12 19 (12 + 7) , 0
.12 (19 - 7) 19 0 0
4:..
. 7,.
5.- 7
~ 2~ (16 + 5) 22 (27 - 5) 27
--
6 1.6
0
1,3 15 (13 + 2) 0
25 (27 - 2) 27 12 12
8-7 19 · 27 (19 + 8) 19 (27 8)
:.--,
27
'
/ :0/
' 0 L/
 ,..,f iJ ~ Kl - EFT II - .n
.· .,... .,o h4Vtl the followin g calculations
, ,,..,.~k-,r [l - 21 - EFT (0 - l] = 2 - 2 = o
• . lltf~ _ ll " EST 11
. - 31 - EFT 10 - 11 =2 - 2 = o
10
~• ,. • &.ef 12 - 4 or 2 - 51 - EFI' (1 - 2) = 10 - 10 = o
I

.,, • ~r 13 - 4 or 3 - 61 - EFI' I1 - 31 = 12 - 12 = o
1
, ',, ,, SSf (4 - 71 - EFT (2 - 41 = 16 - 16 = o
; Si ,, EST 15 - 7) - EFI' (2 - 5] =13 - 13 =0
. ; = EST 14 - 71 - EFI' [3 - 41 = 16 - 15 = 1
4
. tl = EST 16 - 71 - EFI' (3 - 6] = 19 - 19 = O -

·q _ 'iJ = 21 - EF1' (4 - 7J = 27 - 21 = 16
,., ; • 71 = 27 - EFT 15 - 71 =27 - 15 =12
-r 5- 71 == 27 - EFI' (6 - 71 = 27 - 27 = 0
~~ nt Float-= IF [i-J~ = E--L-
'l ' - t 'f,J--

; w - L0 - t01 = 2 - 0 - 2 = O
1] = E1 -
. : - 21= E2 - L~- t 12 = 10 - 2 - 8 =O
~ ~ - J] =Ea-Li - t13 = 12 - 2 - 10 = 0
; .1- ,1= B• - T - t 24= 16-16- 6=-6
-z-
7 :2 - 51=E - L,. - t25 = 13 - 16 - 3 = - 6
5

,.f',., -•l =1• - L3 - tu = 16 - 12 - 3 = 1

' 'l
r.-·-61 =!• - L3- t,a = 19 - 12 - 7 = O
.~ i-7J =I7 - L~ -
f t,., = 21 - 22 - 5 =O
'"7J= E1 - L5 -
;. 't t57 = 27 - 25 - 2 = 0
.,~7Ji: g -L
. "..~ , 1 a- t51 = 27 - 19 - 8 = o
.-, ~~ Path .
•l, 3 - 6, 6 ~ a path connect ed by the activitie s
7
 1-6 2-3 2- 4 3-5 4-5
1-2 6-7 s.
Job : 2 2 2 7 •·, 5 8
5 10 5 5 3 t~
a (days): 71 5 14 8
8
m (~ays): 8 19 l 7 29 3 Ii
13 14 26
b (days): 9
d find the pr 0b . ai
Draw the project ne tw or k an ability¾
pro jec t is co mp let ed in 40 days.
the
(BE Mech. MD 0
n: Fi rst we ca lcu lat e th e expected time and et'~,
Solutio s.n.~
each activity.
4 3-5 4-5 6-7 5-8 7
Activity: 1-2 1-6 2-3 2- 7 11 4 ,ij
7 6 14 5 11
te: 1
1 2 2 4 ~
s,: 2 2 4 1 4
e of th e activities w
Making use of ex pe cte d tim ' e car
n.
determine th e project du ra tio

1+
( 0 ,o ) I

' \I \8
7
(1 1, fi)

36 days.
Expected project du ra tio n =
- 5 - 8 .
Cr iti ca l Path: 1 - 2 - 3
~•
Now we calculate the pr ob ab ili ty that the proJ
complet.ed in 40 days
Here T, = 36, T= 40

SD = ✓ + 16 + 4 + 16 = ✓40 = 6.3
4 -

3.72
 t, ~::0.6
y == 6.3
:: ~ pt,:: 0.6] = 0 • 1.U 7

I~
1
'°
f 1 s: 1 . th
for comp etillg e project in 40 days is
. o• ''51
Data for a &1etwork is given below.
18

1-2 1-3 1-4 2-5 3-5 4-6 5-6

~ 1 2 1 2 2
1 3
~
1 4 2 1 5 5 6
...
t '

7 7 8 1 14 8 15
~:

1l l)rl1f
1
the project network (b) Find the probability
~ project will be completed
ul atieut , weeks earlier than expected time (ii) no
lhan , weeks later than expected time (c) H · t.he
· due date is 20 weeks, what is the probability of not
·.. the due date. (d) if the probability for the
of the project is 90%, find the scheduled
. time.

Ynt we calculate the expected time and variance of

~-
~ 1-2 1-3 1-4 2-5 3-5 4-6 5-6
!·r
2 4 3 1 6 5 7
v~·
1 i 1 4 1
0 4

~ duration (expected time) are written along th~

~~-
·\::ik start
. .

and latest finish times are represented

Ctitiea} &round ~e respective -nodes.
Path: 1-3-5-6
3.73