
2/83

2


3/83

Network 'iagra

(learl) shows interrelationship "etweene*ents#(an "e %sed for highl) !o pli!ated pro+e!tswith large a!ti*ities#Indi!ate ti e re,%ired in "etween two

ilestones or a!ti*ities# -elpf%l inres!hed%ling& if re,%ired#If %n!ertainties are re,%ired& it allows

pro"a"ilit) theor) for ti e esti ations3


4/83

I portan!e of .lanning / $!hed%lingail%re to plan and s!hed%le leads to

e !essi*e la"or !ost&

e,%ip ent waiting ti e& dela)s& waiting for aterials&

la!k of !oordination& and anage ent ina"ilit) to rea!t

to %ne pe!ted e*ents weather& e,%ip ent "reakdowns&

shortages

.rod%!ti*it) oss4


5/83

Network Diagramilestones on ar (hart *ents: 1&2

21

3 4 5

6

8

7

9 10

2#0

2#0 1#5

3#0

2#0 1#5

o" on ar (hart

A!ti*ities 3 4& 4 5

5


6/83

Network 'iagra sDefinition

A network consists of two basic elements, nodes and links

between these nodes

Activities on arrows (CPM: Critical Pat !etwor"#

Activities are represented by two nodes and one link Activities on no$es (CPM an$ P%&' Pro)ra*

%val+ation &eview tec ni,+es !etwor"#

Activities represented by nodes and links represent the

relationship

6


7/83

)pes of Network diagra s

(lear and

gr%"

( % t a

n d 0 i

l l

.la!e

ase

!a*ate / for!%l*ert

(onstr%!t

(%l*ert

.a*e

Activity based CPM

Clear e$ -.r+//e$

C+tte$ -fille$

% cavate$

c+lvertfor*e$

asePlace$

C+lvert

Constr+cte$

Pave$

Event based PERT

tart

7


8/83

A!ti*it) / *entshe pro+e!t to "e planned ") network

te!hni,%e sho%ld !learl) !onsists of

recognizable jobs or o erations & %s%all)!alled a!ti*ities#

hese +o"s& operations or a!ti*ities %st ha*e

de!inite commencement and com letion #he start or end of a +o" or operation or

a!ti*ities !alled an e*ent#

8


9/83

*ents;A!ti*ities


10/83

*ents

It is either the start or !o pletion of ana!ti*it)

=epresents noteworth)& signifi!ant andre!ogni>a"le point in the pro+e!t#It is an a!!o plish ent o!!%rring at an

instantaneo%s point in ti e& "%t re,%iring noti e or reso%r!e itself#

10


11/83

Activity

Act"al Per!ormance o! task#Recognizable art o! a work roject t$at

re%"ires time & reso"rces#E'am le(

E'cavate trenc$

Mi' concrete Pre are s eci!ications Assemble arts

11


12/83

'% ) A!ti*it)A d% ) is a t)pe of operation in thenetwork whi!h neither re,%ires an) ti e noran) reso%r!es& "%t is erel) a de*i!e toidentif) a dependen!e a ong operations#

1 2 3

4 5 6

'% ) 2&5

12


13/83

'% ) A!ti*it) : ?ra ati!al.%rposes

1 2

A1

3

2

' @ 5 5 A

A

a A I?@B@$= .= $ N A IBN

" ?=A A I(A( A= = .= $ N IBN

13


14/83

'% ) A!ti*it) : ogi!al p%rposes

1

.

2

3

. 1

C

A1

A 4 (

= = 3

.

C

A1

2A 4 (

Bnl) 1 a!ti*it) is e anating fro 1& !an "e re o*ed

A INI IA B'I I '

14


15/83

ogi!al .%rpose

. 1 9 ' @ 5

5 A

. 2 9 ' @ 5 5 A

B

.C

= .

N

.

B

N

C

=

. !annot ha*e d%al identit)# @ni,%e identit)

A I B?I(A= .= $ N A IBN

B?I(A= .= $ N A IBN

15


16/83

Introd%!e '% ) in the network

@I ' DA

IE ( =I(A (BN'@I $

(B .. @ IN?

(B . BIN =I $

. A$ =

D

16


17/83

'% )

BUILD

WALL

F I X L ! "

# I ! A L

! $ % D

U I " &

!$'(L " (LU'BI%)

! $ ' ( L " * $ I % # I &

DU''+ A

DU''+ A-

(LA&" #

WALL

17


18/83

'raw he Network ") introd%!ing'% ies

In a retainin. wall constr/ction, A,B,! represent thesh/tterin. operations for three connectin. walls and (,

0, # represent correspondin. concretin. operations1 Ass/me that in each case sh/tterin. has to precedeconcretin.1$nly one crew for form work operation and another

crew for concretin. operation is available1 Usin. d/mmies, show the network, representin. therestraints and the conse2/ent interdependencies1

18


19/83

A

(

.

C

=

' 1 ' 2

' 3 ' 4

19


20/83

1 2

3

4

5

Network =%les)# *nitial node $as only o"tgoing arrows# T$ere

m"st be only single initial node in a network +# T$ere m"st not be any dead end le!t e'ce t t$e

!inal node# ,inal node $as only incomingarrows# T$ere m"st be only single !inal nodeevent#

Bnl) $ingleinal Node

Bnl) $ingleInitial Node 20


21/83

Network =%les3# An e*ent !annot o!!%r %ntil all the a!ti*ities

leading to it are !o pleted#4# An e*ent !annot o!!%rs twi!e#

1 2

3

4

5 6

5# No a!ti*it) !an start %ntil its tail end e*ent has

o!!%rred#

No wi!e

21


22/83

Network =%les6# An) arrow sho%ld represent sing%lar sit%ation&

i#e#& indi*id%alit) and separate entit) of an a!ti*it)%st "e aintained in a network diagra #

A

(

'

.

.

C

=

$

$eparate

Identit)

22


23/83

Network =%les

7# =epresentation of the network sho%ld "e s%!h thate*er) a!ti*it) is !o pleted to rea!h the endo"+e!ti*e#

8# All !onstraints and interdependen!e sho%ld "eshown properl) ") %se of appropriate d% ies #

9# ogi! of network sho%ld alwa)s "e aintained&

i#e#&arrowheads point !orre!t wa) to indi!ate thetr%e !ontrol sit%ation#

10# It is %s%al pra!ti!e to show the ti e flow fro

left to right 23


24/83

$o e ?raphi!al ?%idelines

Arrows are not *e!tor# Dide *ariation inlength is a*oided#

Angle "etween arrows lea*ing or +oiningsho%ld "e large#$traight arrows to "e %sed& !%r*ed a*oided

Arrows generall) not !ross ea!h other#

24


25/83

$o e .ra!ti!e.ro"le s

25


26/83

B is controlled by A# o eration B

cannot begin "ntil o eration A is

com leted

C is controlled by A &B# - eration

C cannot begin "ntil o eration A &

B are com leted

Activities B &C are controlled by

Activity A# Neit$er o! activities B& C can start "nless A is

com leted

A

A

(

A

(

26

A i i i C & D ll d b


27/83

Activities C & D are controlled by

activities A & B# Neit$er o! activities C &

D can start "ntil A & B are com leted

Activity B is controlled by A & C#

.owever/ activity D is controlled

by activity C only#

.int( D"mmy Activity is re%"ired

A

(

'

'@

A

( '

27


28/83

Activity D is controlled by A & B/ w$ile activity E is

controlled by B & C#

'@

A '

( '@

28


29/83

Activity D is controlled by A B & C/ .owever/ activity E is

controlled by B and C#

'@ A '

(

'@

29


30/83

Activity A controls C and D/ w$ile activity B

controls D & E# T$"s D is controlled by bot$ A

& B

'@

A

'

(

'@

30


31/83

Activity 0 is controlled by D & A1 activity 2 is controlled by

A/B &C/ w$ile activity 3 is controlled by D only#

'@

'

E

F

(

A

31

N% " i g th * t %lk


32/83

N% "ering the e*ents %lkerson=%le

1# here is a single initial e*ent in a networkdiagra # his initial e*ent will ha*e arrows!o ing o%t of it and none entering it# N% "er thisinitial e*ent as 1#

2# Negle!t all the arrows e erging o%t of the initiale*ent n% "ered 1# 'oing so will apparentl) pro*ide one or ore new initial e*ents#

3# N% "er these apparentl) prod%!ed new e*ents as

2&3&4 et!#&4# Again negle!t all e erging arrows fro these

n% "ered e*entsG this will !reate few ore initiale*ents#

5# ollow step 3 32


33/83

%lkerson =%le

(ontin%e this operation %ntil the laste*ent& whi!h has no e erging arrows&is n% "ered

33


34/83

N% "er the following network

34


35/83

N% "ered *ents

35


36/83

N% "er the *ents

10

36


37/83

10

40

20

30

70

60 90

100

110

80

50

37


38/83

*ent Briented 'iagra :

*ent Briented 'iagra :phasis pla!ed on e*ents#

Interest is on start or !o pletion of e*entsrather than a!ti*ities#

he en% erated e*ents are !onne!ted ")arrows to show how the) are related to !%rrent

plans for a!!o plishing the pro+e!t

38


39/83

'raw the Network *ent Briented

A pro3ect plan consistin. of ten events have predecessorrelationships as /nder4

*ent I ediate

.rede!essor

*ent I ediate

.rede!essor

1 6 3&52 1 7 3&43 2 8 3&74 2 9 75 2 10 3&6&8&9

39


40/83

a "

! d

1 23 1 2 3

4

5

1 2 3

4

5

6

1 2 3

4

5

6

7

40


41/83

Network

1 2

5

4

3

6

8

7 9

1

4

2

5

7

3

6

8

9

10

41


42/83

A!ti*it) Briented 'iagra

phasis pla!ed on a!ti*ities rather than e*ents#A!ti*ities are arranged in se,%ential and logi!al

orders#After the diagra is drawn& one !an sele!t!ertain ke) e*ents for progress reporting#

42


43/83

A!ti*it) Briented 'iagra s

A!ti*it) A and "eing done!on!%rrentl)#

A!ti*it) ( is the i ediates%!!essor a!ti*it) A#

A

a

A (

"

43

A!ti*it) ' is the i ediate s%!!essor to a!ti*it) #


44/83

A!ti it) is the i ediate s%!!essor to a!ti it) #

A(

'

A!!o plish ent of ( and ' arks the !o pletion of the pro+e!t#

A (

'

1

2

3

4

!

d

44


45/83

Network 'iagra A!ti*it) Briented

A is the first operation1B and ! can be performed in parallel and are

immediate s/ccessor to A1

D, and F follows B1) follows 15 follows D, b/t it cannot start /nit is

complete1I and * s/cceed )1F and * precede 615 and I precede L1' s/cceeds L and 61"he last o eration % s/cceeds ' and !1

45


46/83

A

(

"

A

(

'

a

46


47/83

'@

A

(

'?

!

d

A

(

'

-

? I

H

47

k % i


48/83

'@

A

6

(

'

?

-

0

I4

H

N

Network: N% "ering as .er%lkerson =%le

48

N k N% " i


49/83

'@

A

6

(

'

?

-

0

I4

H

N

1 2

3 4

5

6

7

8

9

10

11

Network: N% "ering as .er%lkerson =%le

49


50/83

.lanning of Network orward .lanning

.lanner starts fro the initial e*ent

"%ild %p e*ent and a!ti*ities logi!all)%ntil end e*ent is rea!hedDhat !o es Ne t Disin!ection

; Commissioning o! new 4TP & 4l"dge

Predecessors

Documents

CE-401CE 2.0 Network Diagrams 2015