Sie sind auf Seite 1von 6

Difference between AOA &

AON
PMRE Practicals

AOA network - activity on arrow

TFLij

EETi

i
LETi

ESij

LSij

Aij
Dij

AON network- activity on node

FFLij

EFij
LFij

TF/ FF
EETj

j
LETj

ES Activity name EF
LS

Duration

LF

Comparison of AOA, AON


AOA

AON

Activities depicted on arrow


Nodes are termed events- which
have EET- early event times &
LET- Late event times
AOA takes up on FS relationship
and no lag can be depicted
It is a stepping stone to AON and
is not used presently

Activity depicted on node


Here arrows depict relationships
such as FS- finish to start, SSstart to start, SF- Start to finish,
FF- Finish to finish
The arrows may also show lag
along with relationships for eg.
FS2, FS0, SS1, etc.

Checking AOA & AON networks for


correctness
AOA

AON

No two arrows to be present between two


events

No dummy activities to be present except


start and finish

No cyclic arrows allowed , same as in AOA


network

2 dummies arrows can be drawn from one


event and vice versa
No cyclic loops allowed

Formulas
TFLij

ESi
i

EETi
LETi

ESij Aij
Dij
LSij

EFij
LFij

TFj / FFj

TFi/FFi

FFLij

EETj
LETj

LSi

Activity- i,
Duri

EFi
FS(lag)
LFi

ESj
LSj

Activity- j,
Durj

AOA Network

AON Network

EETj = EETi + Dij (during forward


pass step)
LETi = LETj- Dij (during backward
pass step)
TF= LSij- ESij or LFij- EFij
Freefloat= EEThead- EET tail - Dij

1.
2.

EFi= ESi + Duri (during forward pass)


LSi= LFi - Duri (during backward pass)

3.

When relationship is FS(lag)


Freefloat of i= ESj-FSlag-EFi

4.

When relationship is SS(lag)


Freefloat of i = ESj-SSlag-ESi

5.

When relationship is SF(lag)


Freefloat of i = EFj-SFlag-ESi

6.

When relationship is FF(lag)


Freefloat of i = EFj-FFlag-EFi

EFj
LFj

Step to solve AOA & AON network


TFLij

ESi
i

EETi
LETi

ESij Aij
Dij
LSij

EFij
LFij

TFj / FFj

TFi/FFi

FFLij

EETj
LETj

LSi

Activity- i,
Duri

EFi
FS(lag)
LFi

AOA Network

AON Network

1. First step-- Forward pass to


calculate- EET, ES, EF
2. Second step-- Backward passLET, LF LS
3. Third step-- Total float & Free
float calculation
4. Final step- Find critical path
(activity with both Total float
& free float as zero)

1.

2.

3.
4.

ESj
LSj

Activity- j,
Durj

EFj
LFj

First step-- Forward pass to calculate-ES, EF


(here no EET exists), and (when lag exists)
lag should be added to ES of subsequent
activities
Second step-- Backward pass- LF LS (here
no LET exists), (when lag exists) lag should
be subtracted to get LS or LF of preceding
activity
Third step-- Total float & Free float
calculation (for free float formula changes
for each type of relationship FS, SS, SF, FF)
Final step- Find critical path (activity with
both Total float & free float as zero)

Das könnte Ihnen auch gefallen