NETWORK MODELS

NETWORK MODELS
A Network is defined by two sets of symbols: Nodes & Arcs
Nodes- or vertices are the points
Arcs-It consists of an ordered pair of vertices and represent a
possible direction of motion that may occur between vertices.
e.g. V={1,2,3,4} A={(1,2),(2,3),(3,4),(4,1)
For any activity (j,k),
j is the initial node and k is the terminal node
Chain-A sequence of arcs such that every arc has exactly one vertex
in common with the previous arc.
Path-A chain in which the terminal node of each arc is identical to
the initial node of the next arc.
Shortest Path Problem –Finding the path of minimum length from
node 1 to any other node in the network

EM 505 Operations
Research
 NETWORK MODELS (cont’d)
Critical Path Method (CPM)- We need a list of the activities that
make up a project. If the duration of each activity is known
with certainty, the CPM is used to determine the length of
time required to complete a project and how long each
activity in the project can be delayed without affecting project
completion.
(Developed in the late 1950s by researchers at du Pont and Sperry Rand)

Project Network-To represent the precedence relationships

between activities. Activities are represented by directed arcs
and nodes indicating completion of a set of activities. Also
known as Activity on Arc (AOA) Network. Nodes are referred
to as Events.

EM 505 Operations
Research
 LP Application to CPM
LP can be used to find a Critical Path and the duration of the Project
Let
Xj = time at which node j in project network occurs
F = node representing finish or completion of the project
tij = duration of activity represented by arc (i,j)

to find critical path,

Minimize Z= XF – X1
subject to
Xj – Xi  tij for each arc
Xj urs
* Optimal Z-value is the length of time to project completion
• Find the path from node 1 to node F for which each arc in the path
is represented by an arc (i,j) whose constraint (Xj – Xi  tij) has a
dual price of 1.

EM 505 Operations
Research
 CPM Example solved by Normal Procedure
1 7 7 13
B(6) D(6)
0 1 13 14
A(1) 1 7 7 13 F(1)
1 9 9 12
0 1 E(3) 13 14
C(8)

2 10 10 13

1 7 7 13
B(6) D(6)
0 1 13 14
A(1) 1 7 7 13 F(1)
1 9 9 12
0 1 E(3) 13 14
C(8)

2 10 10 13
EM 505 Operations
Research
 CPM Example solved by LP

Minimize Z= XG – XA
subject to
X B – XA  1
XC – XA  1
X D – XB  6
X E – XB  6
XE – XC  8
X F – XD  6
X F – XE  3
XG – XF  1
Xj urs

EM 505 Operations
Research
 CPM Example—LP Solution using Excel
Minimize Z= XG – XA
subject to
XB – XA ³ 1
XC – XA ³ 1 B D
A(1) B(6) D(6)
XD – XB ³ 6 A F F(1) G
XE – XB ³ 6 A(1) E(3)
XE – XC ³ 8 C C(8) E
XF – XD ³ 6
XF – XE ³ 3
XG – XF ³ 1
Xj urs

XA XB XC XD XE XF XG
-13 -12 -11 -6 -3 -1.1E-13 1 14

1 1
2 1
6 6
9 6
8 8
6 6
EM 505 Operations
Research
3 3
1 1
 LP Application to CPM- Example
Consider a simplified list of activities and predecessors that are involved
in building a house:

Activity Description Immediate Predecessors Duration (days)

A Build Foundation -- 5
B Build walls & columns A 8
C Build Roof B 10
D Do Electrical Wiring B 5
E Put in Doors & Windows F B 4
F Do Plaster& Flooring E 6
G Paint House C, F 3
Draw project network, determine the critical path.
 LP Application to CPM- Example
Consider a simplified list of activities and predecessors that are involved
in building a house:

Activity Description Immediate Predecessors Duration (days)

A Build Foundation -- 5
B Build walls & columns A 8
C Build Roof B 10
D Do Electrical Wiring B 5
E Put in Doors & Windows F B 4
F Do Plaster& Flooring E 6
G Paint House C, F 3
Draw project network, determine the critical path.

A B
1 C G
2 3 5 6

EM 505 Operations E F
Research 4
 Let
Xj = time at which node j in project network occurs
6 = node representing finish or completion of the project
tij = duration of activity represented by arc (i,j)

to find critical path,

Minimize Z= X6 – X1
subject to
X2 – X1  5
X3 – X2  8
X4 – X3  4
X5 – X3  10
X5 – X4  6
X6 – X3  5
X6 – X5  3
Xj urs
Optimal Z-value 26 days.

EM 505 Operations
Research
Problem 2 CPM: Consider the following project:
Immediate
Activity Predecessor Time (days)
A -- 6
B -- 4
C A 3
D A 5
E A 1
F B,C 4
G B,C 2
H E,F 6
I E,F 5
J D,H 3
K G,I 5
 Backward LF
ES
6 20

6 19
D
2 5 5
J
1 6
0 A
6 E H 3 23
13
1 C 3
4 7
0 4 5
F 13 5
B 4 I 23
K
2
3 6
G
9 18

9 18
• Problem 1
The following details are available regarding a
project:

• Determine the critical path, the critical activities

and the project completion time
• The critical activities are A, B, D and F. The
project completion time is 22 weeks.

CI 505 Operations Research

Lecture 24-25
Problem 2
Find out the completion time and the
critical activities for the following
project:
• The critical activities are C, F, J and L. The non-
critical activities are A, B, D, E, G, H, I and K.
The project completion time is 47 units of
time.

CI 505 Operations Research

Lecture 24-25
 PROJECT CONTROL
CRASHING ON ACTIVITIES
Crashing an activity refers to taking special costly measures
to reduce the duration of an activity below its normal value.
Crashing the project refers to crashing a number of
activities in order to reduce the duration of the project
below its normal value.
The CPM method of time-cost trade-offs is concerned with
determining how much to crash each of the activities in
order to reduce the anticipated duration of the project to a
desired value.
The data necessary for determining how much to crash a
particular activity is given by the time-cost graph for the
activity.
 PROJECT CONTROL
CRASHING ON ACTIVITIES

The normal point on the time-cost graph for an activity shows the time and cost
of the activity when it is performed in the normal way.
The crash point shows the time and cost when the activity is fully crashed.

EM 505 Operations
Research
 LP Application to CPM- Example …cont’d
Suppose by hiring additional workers, the duration of each activity can
be reduced as per following:

Activity Cost ($) per day of Max possible Reduction

Reduced Duration in Duration (days)

Foundation 30 A 2
walls & columns 15 B 3
Roof 20 C 1
Electrical Wiring 40 D 2
Doors & Windows 20 E 2
Plaster& Flooring 30 F 3
Paint House 40 G 1
Write Lp to be solved to minimize the total cost of completing the
D project within 20 days.

A B
1 C G
2 3 5 6

EM 505 Operations E F
Research 4
 Let, A, B, C, D, E, F, G are non negative number of days reduction in
corresponding activities
Xj = time at which node j in project network occurs
6 = node representing finish or completion of the project
tij = duration of activity represented by arc (i,j)

Minimize CRASHING COST= 30A+15B+20C+40D+20E+30F+40G

subject to
X2 – X1  5-A
X3 – X2  8-B
X4 – X3  4-E
X5 – X3  10-C
X5 – X4  6-F
X6 – X3  5-D
X6 – X5  3-G
X6 – X1  20
A 2; B  3; C  1; D  2; E  2; F  3; G  1
A, B, C, D, E, F, G  0; Xj urs

EM 505 Operations
Research Lecture
 Assignment
1. Prepare a project network for the following and solve
using LP. Identify the critical path.
Activity Symbol Duration (Days) Predecessor

Project Start A 0
Mobilization B 7 A
Site Clearance C 3 B
Layout & Marking D 2 C
Excavation E 10 D
Foundation F 20 E
Plinth Beams G 5 F
Columns H 10 G
Beams/ Slabs I 30 H
Block Masonry J 20 I
Plaster K 20 J
Doors/ Windows L 40 J, K
Painting M 10 J
Project Finish N 0 L, M

EM 505 Operations
Research
EM- 505 Operations Research
Activity on Arc (AOA) Diagram