Scribd
Upload
61 views14 pages

Activity On Nodes

This document discusses activity on node (AON) networks for project scheduling. It provides information on how to draw AON networks and the rules for AON. It also shows examples of using AON networks to solve scheduling problems by calculating early start, early finish, late start and late finish times. The forward and backward pass methods for determining the schedule are demonstrated on sample problems. Key aspects of AON, such as no need for dummy activities and allowing multiple start/end points, are highlighted.

Uploaded by

Harsh Kumar Jhunjhunwala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
61 views14 pages

Activity On Nodes

This document discusses activity on node (AON) networks for project scheduling. It provides information on how to draw AON networks and the rules for AON. It also shows examples of using AON networks to solve scheduling problems by calculating early start, early finish, late start and late finish times. The forward and backward pass methods for determining the schedule are demonstrated on sample problems. Key aspects of AON, such as no need for dummy activities and allowing multiple start/end points, are highlighted.

Uploaded by

Harsh Kumar Jhunjhunwala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

ACTIVITY ON NODES

-Prof. Pradeep Pai


Group 6

DRAWING THE
PROJECT
NETWORK
Activity On Node
Activity On
Arc/Arrow
Activity on Arrow
networks show each
activity as an arrow,
and the nodes
represent the starting
and ending points

Activity on Node
networks show each
activity as a node and
arcs show the
immediate
predecessor activities

Node Design
Early
Start

Free
ES
EF
Float
Free Float EarlyTotal
Finish
TotalFloat
Float

Act
LS

Activity
Late
Start

ES
Early
Start

Act
LS

Dur
LF

Duration
Late
Finish

Free
EF
Float
Free Float
TotalEarly
FloatFinish
Total Float

Activity
Late
Start

Every activity is shown in rectangle

Dur
LF

Duration
Late
Finish

RULES OF ACTIVITY ON
NODE
No need for a dummy
Multiple start and multiple end is
possible
Sufficient space to write between the
arrows
Arrows cannot come back
Cannot start from top or bottom
Relationship is from left to right

Free
Float

ES

EF

ES

Total
Float

Act
LS

Act
LS
ES

ES

EF

ES

Free
Float

Dur
LF
Free
Float

EF

Act
LS
ES

Dur
LF
Free
Float

EF
Total
Float

Total
Float

EF

EF
Total
Float

Total
Float

Dur
LF

Free
Float

Free
Float

Total
Float

Act
LS

Dur
LF

Act
LS
ES

Free
Float

Dur
LF
EF

Act
LS
ES

Total
Float

Total
Float

Act
LS

Dur
LF

Free
Float

Dur
LF
EF

Act
LS

Dur
LF

PROBLEM 1
Act
A
B
C
D
E
F
G
H
I
J

Dur Pred
3
5
A
7
A
4
B
6
C
4
C
5
D,E
8
G,F
2
G
4
H,I

ES
0
3
3
8
10
10
16
21
21
29

EF
3
8
10
12
16
14
21
29
23
33

LS
0
7
3
12
10
17
16
21
27
29

LF
3
12
10
16
16
21
21
29
29
33

Total Free
Float Float
0
0
4
0
0
0
4
4
0
0
7
7
0
0
0
0
6
6
0
0

(0) 3
0

A
0

3
3

(0) 8
4

B
7

5
12

SOLUTION
8
12
16
21
(4)

D
12

4
16

3 (0 10

10 (0 16

C
3

7
10

(0
) 0

E
10

6
16

G
16

5
21

2 (6) 23
1
6
I
2
7

21 (0 29
)

H
21
10 (7)14
7

F
17

4
21

2
29

29 (0
)

8
29

J
29

3
3
0
4
33

FORWARD PASS
0

To determine early start


(ES) and early finish
(EF) times for each task:
Work from left to right
Adding times in each
path
(EF= ES+ Activity
Duration)
Rule: when several
tasks converge, the ES
for the next task is the
largest of preceding EF
times

FF+
2
A

SS+
2
A

FS1
A

10

FS+
1
A

BACKWARD PASS
To determine the last
finish (LF) and last
start (LS) times:
Start the end node
Compute the
bottom pairs of
numbers
Subtract duration
from connecting
nodes earliest start
time
Rule : Take the lowest
value when several

(FF+
2)

(SS+
2)

-(FS1)

10

(FS+
1)

PROBLEM 2
ACTIVIT Description
Y

COMPLETIO
N TIME

Redesign product

Redesign packaging

Order and receive components for


redesigned product

Order and receive material for redesigned


packaging

Assemble products

Make up packaging

Package redesigned product

Test market redesigned product

Revise redesigned product

Revise redesigned packaging

Present results to the Board

Activit Duratio
y
n
A
5
B
3
C
4
D
7
E
5
F
G

3
2

H
I
J

6
3
4

Predec Relatio
essor
n

A
A
C
C

FS-2
FS+3
SS
FF+4
FS,FSB,D
1
E
FS
FS,FSF,G
2
G
FS
H SS+4
FS,FF
I,J
+1

ES

EF

LS

LF

Total Free
Float Float
0
0
8
8
0
-4
0
-1
1
0

0
3
8
8
11

5
6
12
15
16

0
11
8
8
12

5
14
12
15
17

14
16

17
18

14
17

17
19

0
1

0
0

17
18
21

23
21
25

17
21
21

23
24
25

0
3
0

-2
3
-1

24

26

24

26

SOLUTION
3 (8) 6

0 (0) 5
0

A
0

FS-2

5
5

FS +
3

B
1
1

FS

3
14

8 (0) 12
0

C
8

1 (0) 17
1 (6) 23
2 (0) 25
4
0 FS 7
0 SS+1
0

4
12

F
1
4

8 (0) 15

3
17

FS 1

H
1
7

6 4
23

J
2
1

4
25

FF +
1

SS
D
8

FS - 2

7
15

FF +
4

1 (0) 16
1 (0) 18
1
1 FS 6
1
E
1
2

5
17

G
1
7

2
19

FS

1 (3) 21
8
3
I
2
1

3
24

FS

2 (0) 26
4
0
K
2
4

2
26

Whenever free float is negative,


make it zero
Negative comes because of parallel
working
Relationship Calculation requires
AON method
Cannot be solved by AOA method

Harsh Kumar Jhunjhunwala


Karan Malviya
Amit Jain
Deeksha Darak
Piyush Jajodia
Ekta Agarwal

THANK YOU

B017
B021
B023
B027
B036
B043

You might also like