Ch 5: Network Model

By Mohamed Cherif

1
OR: Ch5 Network Model
Algorithm for the Minimum Spanning Tree
Problem
1. Select any node arbitrarily, and then connect it (i.e.,add a link) to the
nearest distinct node.

2. Identify the unconnected node that is closest to a connected node, and then
connect these two nodes (i.e.,add a link between them). Repeat this step
until all nodes have been connected.

3. Tie breaking: Ties for the nearest distinct node (step 1) or the closest
unconnected node (step 2) may be broken arbitrarily, and the algorithm must
still yield an optimal solution However, such ties are a signal that there may
be (but need not be) multiple optimal solutions. All such optimal solutions can
be identified by pursuing all ways of breaking ties to their conclusion.

2
OR: Ch5 Network Model
Example 1
The Seervada Park management needs to determine under which roads telephone phone
lines should be installed to connect all stations with a minimum total length of line. Nodes
and distances for the problem are summarized below, where the thin lines now represent
potential links

3
OR: Ch5 Network Model
Solution

Arbitrarily select node O to start. The unconnected node closest to node O is node A.
Connect node A to node O.

4
OR: Ch5 Network Model
The unconnected node closest to either node O or node A is node B (closest to A). Connect
node B to node A.

5
OR: Ch5 Network Model
The unconnected node closest to node O, A, or B is node C (closest to B).
Connect node C to node B.

6
OR: Ch5 Network Model
The unconnected node closest to node O, A, B, or C is node E (closest to B).
Connect node E to node B.

7
OR: Ch5 Network Model
The unconnected node closest to node O, A, B, C, or E is node D (closest to E). Connect
node D to node E

8
OR: Ch5 Network Model
The only remaining unconnected node is node T. It is closest to node D. Connect node T
to node D

9
OR: Ch5 Network Model
All nodes are now connected, so this solution to the problem is
the desired (optimal) one. The total length of the links is 14 miles.

10
OR: Ch5 Network Model
Iteration Process

Cumulative
Iteration Arc miles
miles
1 O to A 2 2
2 A to B 2 4
3 B to C 1 5
4 B to E 3 8
5 E to D 1 9
6 D to T 5 14

11
OR: Ch5 Network Model
Example 2

Manager in a transportation company that

needs to deliver goods to multiple

destinations. You have a set of cities where

your trucks need to deliver goods, and you

want to find the optimal route that minimizes

the total distance traveled by your fleet.

Nodes and distances for the problem are

summarized below, represent potential links

12
OR: Ch5 Network Model
Solution (iteration1)

13
OR: Ch5 Network Model
Iteration 2

14
OR: Ch5 Network Model
Iteration 3

15
OR: Ch5 Network Model
Iteration 4

16
OR: Ch5 Network Model
Iteration 5

17
OR: Ch5 Network Model
Iteration 6

18
OR: Ch5 Network Model
Iteration Process

Cumulative
Iteration Arc Distance
distance
1 A to B 4 4
2 B to D 8 12
3 D to C 2 14
4 C to F 1 15
5 F to G 2 17
6 F to E 5 22

19
OR: Ch5 Network Model
the optimal route that minimizes the total distance traveled by your fleet is 22
miles

20
OR: Ch5 Network Model
Example 3

A manufacturing company has several factories across the country and needs to
determine the most cost-effective way to transport raw materials and finished goods
between its facilities. Nodes and distances for the problem are summarized below,
represent potential links

21
OR: Ch5 Network Model
Iteration1

22
OR: Ch5 Network Model
Iteration 2

23
OR: Ch5 Network Model
Iteration 3

24
OR: Ch5 Network Model
Iteration 4

25
OR: Ch5 Network Model
Iteration 5

26
OR: Ch5 Network Model
Iteration 6

27
OR: Ch5 Network Model
Iteration Process

Cumulative
Iteration Arc Distance
distance
1 A to C 1 1
2 C to E 2 3
3 C to D 3 6
4 A to B 5 11
5 B to F 6 17
6 E to F 9 26

28
OR: Ch5 Network Model
 the most cost-effective way to transport raw materials and finished goods between

its facilities is 26 miles .

29
OR: Ch5 Network Model
 Shortest-
Route
Algorithms

Dijkstra's
algorithm Floyd's
algorithm

30
OR: Ch5 Network Model
1. Dijkstra's algorithm
is designed to determine the shortest routes between the source node and every
other node in the network

2. Floyd's algorithm
is more general because it allows the determination of the shortest route
between any two nodes in the network.

31
OR: Ch5 Network Model
Dijkstra's algorithm

1. Initialize the starting node with a distance of 0 and all other nodes with a distance of
infinity. Set all nodes as unvisited.
2. Choose the node with the smallest distance as the current node and mark it as visited.
3. For each neighbor of the current node, calculate the distance from the starting node
to the neighbor through the current node. If this distance is less than the neighbor's
current distance, update the neighbor's distance.
4. Repeat steps 2 and 3 until all nodes have been visited or the destination node has
been visited.
5. Once all nodes have been visited, the shortest path to each node from the starting
node can be found by tracing back from each node to its previous node using the
recorded distances and selecting the path with the smallest total distance.
6. The algorithm terminates when the destination node has been visited or all nodes
have been visited.

32
OR: Ch5 Network Model
Floyd's algorithm

1. Initialize a matrix D with the distances between all pairs of nodes in the graph. If there is no direct
edge between two nodes, set the distance to infinity.
2. For each node i in the graph, consider all possible paths from i to j that pass through some node k. If
the distance from i to j through k is less than the current distance in matrix D, update the distance in
matrix D.
3. Repeat step 2 for all possible combinations of i, j, and k.
4. The final matrix D contains the shortest distances between all pairs of nodes in the graph.
5. To reconstruct the actual paths, create another matrix P to record the previous node on the shortest
path between each pair of nodes. If there is a direct edge between nodes i and j, set P[i][j] = i.
Otherwise, set P[i][j] = the previous node on the shortest path from i to j.
6. To find the shortest path between two nodes i and j, use matrix P to trace back from j to i, following
the recorded previous nodes until reaching i.

33
OR: Ch5 Network Model
Example 4

The network gives the distances in miles between pairs of cities 1,2, ., . , and 8.
Use Dijkstra's algorithm to find the shortest route between the following cities:
(a) Cities 1 and 8
(b) Cities 1 and 6

34
OR: Ch5 Network Model
 Node Label Status
1 [0,---] Permanent
2 [1,1] Permanent
3 [2,1] Temporary
3 [0+1+1=2,2] Permanent
4 [2+2=4,3] Temporary
5 [2+1=3,3] Permanent
6 [2+4=6,5] Temporary
6 [3+3=6,5] Permanent
7 [3+5=8,5] Temporary
8 [3+3+2=8,6] Permanent

35
OR: Ch5 Network Model
Shortest Routes= 1-2-3-5-6-8
Shortest Distance = 8

36
OR: Ch5 Network Model
c) Cities 1 and 6

Node Label Status

1 [0,---] Permanent
2 [1,1] Permanent
3 [2,1] Temporary
3 [0+1+1=2,2] Permanent
4 [2+2=4,3] Temporary
5 [2+1=3,3] Permanent
6 [2+4=6,3] Temporary

6 [3+3=6,5] Permanent

37
OR: Ch5 Network Model
Shortest Routes= 1-2-3-6
Shortest Distance = 6

38
OR: Ch5 Network Model
Example 5

The Tell-All mobile-phone company services six geographical areas. The satellite
distances (in miles) among the six areas are given in Figure. Tell-All needs to
determine the most efficient message routes that should be established between
a) 1 and 5
b) 2 and 5

39
OR: Ch5 Network Model
 D0 S0
1 2 3 4 5 6 1 2 3 4 5 6
1 - 700 200 ∞ ∞ ∞ 1 - 2 3 4 5 6
2 700 - 300 200 ∞ 400 2 1 - 3 4 5 6
3 200 300 - 700 600 ∞ 3 1 2 - 4 5 6
4 ∞ 200 700 - 300 100 4 1 2 3 - 5 6
5 ∞ ∞ 600 300 - 500 5 1 2 3 4 - 6
6 ∞ 400 ∞ 100 500 - 6 1 2 3 4 5 -

40
OR: Ch5 Network Model
Iteration 1

D1 S1
1 2 3 4 5 6 1 2 3 4 5 6
1 - 700 200 ∞ ∞ ∞ 1 - 2 3 4 5 6
2 700 - 300 200 ∞ 400 2 1 - 3 4 5 6
3 200 300 - 700 600 ∞ 3 1 2 - 4 5 6
4 ∞ 200 700 - 300 100 4 1 2 3 - 5 6
5 ∞ ∞ 600 300 - 500 5 1 2 3 4 - 6
6 ∞ 400 ∞ 100 500 - 6 1 2 3 4 5 -

41
OR: Ch5 Network Model
Iteration 2

D2 S2
1 2 3 4 5 6 1 2 3 4 5 6
1 - 700 200 900 ∞ 1100 1 - 2 3 2 5 2
2 700 - 300 200 ∞ 400 2 1 - 3 4 5 6
3 200 300 - 500 600 700 3 1 2 - 4 5 2
4 900 200 500 - 300 100 4 2 2 3 - 5 6
5 ∞ ∞ 600 300 - 500 5 1 2 3 4 - 6
6 1100 400 600 100 500 - 6 2 2 2 4 5 -

42
OR: Ch5 Network Model
Iteration 3

D3 S3
1 2 3 4 5 6 1 2 3 4 5 6
1 - 500 200 700 800 900 1 - 3 3 3 3 3
2 500 - 300 200 900 400 2 3 - 3 4 3 6
3 200 300 - 500 600 700 3 1 2 - 4 5 2
4 700 200 500 - 300 100 4 3 2 3 - 5 6
5 800 900 600 300 - 500 5 3 3 3 4 - 6
6 800 400 600 100 500 - 6 3 2 2 4 5 -

43
OR: Ch5 Network Model
Iteration 4

D4 S4
1 2 3 4 5 6 1 2 3 4 5 6
1 - 500 200 700 800 800 1 - 3 3 3 3 4
2 500 - 300 200 500 300 2 3 - 3 4 4 4
3 200 300 - 500 600 600 3 1 2 - 4 5 4
4 700 200 500 - 300 100 4 3 2 3 - 5 6
5 800 500 600 300 - 400 5 3 4 3 4 - 5
6 800 300 600 100 400 -
6 3 4 2 4 4 -

44
OR: Ch5 Network Model
Iteration 5

D5 S5
1 2 3 4 5 6 1 2 3 4 5 6
1 - 500 200 700 800 800 1 - 3 3 3 3 4
2 500 - 300 200 500 300 2 3 - 3 4 4 4
3 200 300 - 500 600 600 3 1 2 - 4 5 4
4 700 200 500 - 300 100 4 3 2 3 - 5 6
5 800 500 600 300 - 400 5 3 4 3 4 - 5
6 800 300 600 100 400 -
6 3 4 2 4 4 -

45
OR: Ch5 Network Model
Iteration 6

D6 S6
1 2 3 4 5 6 1 2 3 4 5 6
1 - 500 200 700 800 800 1 - 3 3 3 3 4
2 500 - 300 200 500 300 2 3 - 3 4 4 4
3 200 300 - 500 600 600 3 1 2 - 4 5 4
4 700 200 500 - 300 100 4 3 2 3 - 5 6
5 800 500 600 300 - 400 5 3 4 3 4 - 5
6 800 300 600 100 400 - 6 3 4 2 4 4 -

46
OR: Ch5 Network Model
a) Distance from 1 to 5 =800
Routes = 1-3-5

b) Distance from 2 to 5 = 500

Routes = 2-4-5

47
OR: Ch5 Network Model
Example 6

The network gives the distances in miles between pairs of cities 1,2, ., . , and 8.
Use Floyd's algorithm to find the shortest distance between the following cities:
(a) Cities 1 and 8
(b) Cities 1 and 6

48
OR: Ch5 Network Model
 D0 S0
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
1 - 1 2 ∞ ∞ ∞ ∞ ∞ 1 - 2 3 4 5 6 7 8
2 ∞ - 1 5 2 ∞ ∞ ∞ 2 1 - 3 4 5 6 7 8
3 ∞ ∞ − 2 1 4 ∞ ∞ 3 1 2 - 4 5 6 7 8
4 ∞ ∞ ∞ - 3 6 8 ∞ 4 1 2 3 - 5 6 7 8
5 ∞ ∞ ∞ ∞ - 3 7 ∞ 5 1 2 3 4 - 6 7 8
6 ∞ ∞ ∞ ∞ ∞ - 5 2 6 1 2 3 4 5 - 7 8
7 ∞ ∞ ∞ ∞ ∞ ∞ - 6 7 1 2 3 4 5 6 - 8
8 ∞ ∞ ∞ ∞ ∞ ∞ ∞ - 8 1 2 3 4 5 6 7 -

49
OR: Ch5 Network Model
Iteration 1

D1 S1
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
1 - 1 2 ∞ ∞ ∞ ∞ ∞ 1 - 2 3 4 5 6 7 8
2 ∞ - 1 5 2 ∞ ∞ ∞ 2 1 - 3 4 5 6 7 8
3 ∞ ∞ − 2 1 4 ∞ ∞ 3 1 2 - 4 5 6 7 8
4 ∞ ∞ ∞ - 3 6 8 ∞ 4 1 2 3 - 5 6 7 8
5 ∞ ∞ ∞ ∞ - 3 7 ∞ 5 1 2 3 4 - 6 7 8
6 ∞ ∞ ∞ ∞ ∞ - 5 2 6 1 2 3 4 5 - 7 8
7 ∞ ∞ ∞ ∞ ∞ ∞ - 6 7 1 2 3 4 5 6 - 8
8 ∞ ∞ ∞ ∞ ∞ ∞ ∞ - 8 1 2 3 4 5 6 7 -

50
OR: Ch5 Network Model
Iteration 2

D2 S2
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
1 - 1 2 6 3 ∞ ∞ ∞ 1 - 2 3 2 2 6 7 8
2 ∞ - 1 5 2 ∞ ∞ ∞ 2 1 - 3 4 5 6 7 8
3 ∞ ∞ − 2 1 4 ∞ ∞ 3 1 2 - 4 5 6 7 8
4 ∞ ∞ ∞ - 3 6 8 ∞ 4 1 2 3 - 5 6 7 8
5 ∞ ∞ ∞ ∞ - 3 7 ∞ 5 1 2 3 4 - 6 7 8
6 ∞ ∞ ∞ ∞ ∞ - 5 2 6 1 2 3 4 5 - 7 8
7 ∞ ∞ ∞ ∞ ∞ ∞ - 6 7 1 2 3 4 5 6 - 8
8 ∞ ∞ ∞ ∞ ∞ ∞ ∞ - 8 1 2 3 4 5 6 7 -

51
OR: Ch5 Network Model
Iteration 3

D3 S3
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
1 - 1 2 4 3 6 ∞ ∞ 1 - 2 3 3 2 3 7 8
2 ∞ - 1 3 2 5 ∞ ∞ 2 1 - 3 3 5 3 7 8
3 ∞ ∞ − 2 1 4 ∞ ∞ 3 1 2 - 4 5 6 7 8
4 ∞ ∞ ∞ - 3 6 8 ∞ 4 1 2 3 - 5 6 7 8
5 ∞ ∞ ∞ ∞ - 3 7 ∞ 5 1 2 3 4 - 6 7 8
6 ∞ ∞ ∞ ∞ ∞ - 5 2 6 1 2 3 4 5 - 7 8
7 ∞ ∞ ∞ ∞ ∞ ∞ - 6 7 1 2 3 4 5 6 - 8
8 ∞ ∞ ∞ ∞ ∞ ∞ ∞ - 8 1 2 3 4 5 6 7 -

52
OR: Ch5 Network Model
Iteration 4

D4 S4
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
1 - 1 2 4 3 6 12 ∞ 1 - 2 3 3 2 3 4 8
2 ∞ - 1 3 2 5 11 ∞ 2 1 - 3 3 5 3 4 8
3 ∞ ∞ − 2 1 4 12 ∞ 3 1 2 - 4 5 6 3 8
4 ∞ ∞ ∞ - 3 6 8 ∞ 4 1 2 3 - 5 6 7 8
5 ∞ ∞ ∞ ∞ - 3 7 ∞ 5 1 2 3 4 - 6 7 8
6 ∞ ∞ ∞ ∞ ∞ - 5 2 6 1 2 3 4 5 - 7 8
7 ∞ ∞ ∞ ∞ ∞ ∞ - 6 7 1 2 3 4 5 6 - 8
8 ∞ ∞ ∞ ∞ ∞ ∞ ∞ - 8 1 2 3 4 5 6 7 -

53
OR: Ch5 Network Model
Iteration 5

D5 S5
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
1 - 1 2 4 3 6 10 ∞ 1 - 2 3 3 2 3 5 8
2 ∞ - 1 3 2 5 9 ∞ 2 1 - 3 3 5 3 5 8
3 ∞ ∞ − 2 1 4 8 ∞ 3 1 2 - 4 5 6 5 8
4 ∞ ∞ ∞ - 3 6 8 ∞ 4 1 2 3 - 5 6 7 8
5 ∞ ∞ ∞ ∞ - 3 7 ∞ 5 1 2 3 4 - 6 7 8
6 ∞ ∞ ∞ ∞ ∞ - 5 2 6 1 2 3 4 5 - 7 8
7 ∞ ∞ ∞ ∞ ∞ ∞ - 6 7 1 2 3 4 5 6 - 8
8 ∞ ∞ ∞ ∞ ∞ ∞ ∞ - 8 1 2 3 4 5 6 7 -

54
OR: Ch5 Network Model
Iteration 6

D6 S6
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
1 - 1 2 4 3 6 10 8 1 - 2 3 3 2 3 5 6
2 ∞ - 1 3 2 5 9 7 2 1 - 3 3 5 3 5 6
3 ∞ ∞ − 2 1 4 8 6 3 1 2 - 4 5 6 5 6
4 ∞ ∞ ∞ - 3 6 8 8 4 1 2 3 - 5 6 7 6
5 ∞ ∞ ∞ ∞ - 3 7 5 5 1 2 3 4 - 6 7 6
6 ∞ ∞ ∞ ∞ ∞ - 5 2 6 1 2 3 4 5 - 7 8
7 ∞ ∞ ∞ ∞ ∞ ∞ - 6 7 1 2 3 4 5 6 - 8
8 ∞ ∞ ∞ ∞ ∞ ∞ ∞ - 8 1 2 3 4 5 6 7 -

55
OR: Ch5 Network Model
Iteration 7

D7 S7
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
1 - 1 2 4 3 6 10 8 1 - 2 3 3 2 3 5 6
2 ∞ - 1 3 2 5 9 7 2 1 - 3 3 5 3 5 6
3 ∞ ∞ − 2 1 4 8 6 3 1 2 - 4 5 6 5 6
4 ∞ ∞ ∞ - 3 6 8 8 4 1 2 3 - 5 6 7 6
5 ∞ ∞ ∞ ∞ - 3 7 5 5 1 2 3 4 - 6 7 6
6 ∞ ∞ ∞ ∞ ∞ - 5 2 6 1 2 3 4 5 - 7 8
7 ∞ ∞ ∞ ∞ ∞ ∞ - 6 7 1 2 3 4 5 6 - 8
8 ∞ ∞ ∞ ∞ ∞ ∞ ∞ - 8 1 2 3 4 5 6 7 -

56
OR: Ch5 Network Model
Iteration 8

D8 S8
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
1 - 1 2 4 3 6 10 8 1 - 2 3 3 2 3 5 6
2 ∞ - 1 3 2 5 9 7 2 1 - 3 3 5 3 5 6
3 ∞ ∞ − 2 1 4 8 6 3 1 2 - 4 5 6 5 6
4 ∞ ∞ ∞ - 3 6 8 8 4 1 2 3 - 5 6 7 6
5 ∞ ∞ ∞ ∞ - 3 7 5 5 1 2 3 4 - 6 7 6
6 ∞ ∞ ∞ ∞ ∞ - 5 2 6 1 2 3 4 5 - 7 8
7 ∞ ∞ ∞ ∞ ∞ ∞ - 6 7 1 2 3 4 5 6 - 8
8 ∞ ∞ ∞ ∞ ∞ ∞ ∞ - 8 1 2 3 4 5 6 7 -

57
OR: Ch5 Network Model
 Distance from 1 to 8 = 8
 Distance from 1 to 6 = 6

58
OR: Ch5 Network Model
Example 7: Determine the maximal flow and
the optimum flow in each arc for the network

59
OR: Ch5 Network Model
Solution

60
OR: Ch5 Network Model
Iteration 1

61
OR: Ch5 Network Model
Iteration 2

62
OR: Ch5 Network Model
Iteration 3

63
OR: Ch5 Network Model
Iteration 4

64
OR: Ch5 Network Model
Iteration 5

65
OR: Ch5 Network Model
Iteration 6

66
OR: Ch5 Network Model
Example 8 : Apply Maximal Flow Algorithm for
example 1

67
OR: Ch5 Network Model
 68
OR: Ch5 Network Model
 69
OR: Ch5 Network Model
Iteration 3: Assign a flow of 1 to the augmenting path O → A → B → D → T.

70
OR: Ch5 Network Model
 71
OR: Ch5 Network Model
 72
OR: Ch5 Network Model
1.Example 9:
a. Compute Earliest And Latest time
b. Determine Critical and noncritical activity
c. Determine Critical Path
d. Determine TF and FF table and comment on it.
For this Network.

73
OR: Ch5 Network Model
Forward Pass

Node 1 : Set 𝐸1 = 0
Node 2 : Set 𝐸2 = 𝐸1 + 𝐷12 = 0 + 2 = 2
Node 3: Set 𝐸3 = 𝐸1 + 𝐷13 = 0 + 3 = 3
Node 4: Set 𝐸4 = max(𝐸2 + 𝐷24 , 𝐸3 + 𝐷34 ) = 3 + 3 = 6
Node 5: Set 𝐸5 = max(𝐸3 + 𝐷34 , 𝐸4 + 𝐷45 ) = 6 + 0 = 6
Node 6: Set 𝐸6 = max(𝐸4 + 𝐷46 , 𝐸5 + 𝐷56 ) = 6 + 7 = 13
Node 7: Set 𝐸7 = max(𝐸5 + 𝐷57 , 𝐸4 + 𝐷47 , 𝐸6 + 𝐷67 ) = 13 + 6 = 19
The computations show that the project can be completed in 19 days.

74
OR: Ch5 Network Model
Backward Pass

Node 7 : Set 𝐿7 = 19
Node 6 : Set 𝐿6 = 𝐿7 + 𝐷67 = 19 − 6 = 13
Node 5: Set 𝐿5 = 𝑚𝑖𝑛(𝐿7 − 𝐷57 , 𝐿6 − 𝐷57 ) = 13 − 7 = 6
Node 4: Set 𝐿4 = 𝑚𝑖𝑛(𝐿7 − 𝐷47 , 𝐿6 − 𝐷47 , 𝐿5 − 𝐷45 ) = 6 − 0 = 6
Node 3: Set 𝐿3 = 𝑚𝑖𝑛(𝐿4 − 𝐷43 , 𝐿5 − 𝐷43 ) = 6 − 3 = 3
Node 2: Set 𝐿2 = 𝑚𝑖𝑛(𝐿4 − 𝐷23 ) = 6 − 2 = 4
Node 1: Set 𝐿1 = 𝑚𝑖𝑛(𝐿2 − 𝐷21 , 𝐿3 − 𝐷31 ) = 0

75
OR: Ch5 Network Model
Solution

76
OR: Ch5 Network Model
Critical Path

1. 𝐿𝑖 = 𝐸𝑖
2. 𝐿𝑗 = 𝐸𝑗
3. 𝐿𝑗 − 𝐸𝑖 = 𝐷𝑖𝑗
Critical Path 1→ 3 → 4 → 5 →6 → 7

77
OR: Ch5 Network Model
Determination of Floats

 Total Float (TF)= 𝐿𝑗 − 𝐸𝑖 − 𝐷𝑖𝑗

 Free Float (FF) = 𝐸𝑗 − 𝐸𝑖 − 𝐷𝑖𝑗

78
OR: Ch5 Network Model
TF and FF

Noncritical Duration TF FF
activity
A (1,2) 2 4−0−2= 2 2−0−2= 0
B (2,4) 2 6−2−2=2 6−2−2=2
C (3,5) 2 6−3−2=1 6−3−2=1
D (4,6) 3 13 − 6 − 3 = 4 13 − 6 − 3 = 4
E (4,7) 2 19 − 6 − 2 = 11 19 − 6 − 2 = 11
F (5,7) 5 19 − 6 − 5 = 8 19 − 6 − 5 = 8

79
OR: Ch5 Network Model
The computations red-flag activities A because their F F < T F. The remaining
activities have F F = T F, and hence may be scheduled anywhere between their
earliest start and latest completion times.
Turning to red-flagged activity A, we note that its FF = O. This means that any
delay in starting A past its earliest start time (= 0) must be coupled with at least
an equal delay in the start of its successor in all activities.

80
OR: Ch5 Network Model
Example 10
The activities involved in a candlelight choir service are listed in the following table.
Construct the project network.

81
OR: Ch5 Network Model
Answer the following question

1. Construct the project network.

2. Compute Earliest And Latest time
3. Determine Critical and noncritical activity
4. Determine Critical Path
5. Determine TF and FF table and comment on it.

82
OR: Ch5 Network Model
1.

83
OR: Ch5 Network Model
2. Compute Earliest And Latest time
Node 1 : Set 𝐸1 = 0
Node 2 : Set 𝐸2 = 𝐸1 + 𝐷12 = 0 + 2 = 2
Node 3: Set 𝐸3 = 𝐸2 + 𝐷23 = 2 + 14 = 16
Node 4: Set 𝐸4 = max(𝐸2 + 𝐷24 , 𝐸3 + 𝐷34 ) = 16 + 0 = 16
Node 5: Set 𝐸5 = max 𝐸4 + 𝐷45 = 16 + 3 = 19
Node 6: Set 𝐸6 = max 𝐸5 + 𝐷56 = 19 + 14 = 33
Node 7: Set 𝐸7 = max(𝐸5 + 𝐷57 ) = 19 + 7 = 26
Node 8: Set 𝐸8 = max(𝐸7 + 𝐷78 ) = 26 + 14 = 40
Node 9: Set 𝐸9 = max(𝐸8 + 𝐷89 , , 𝐸6 + 𝐷69 , 𝐸5 + 𝐷59 ) = 19 + 70 = 89
Node 10: Set 𝐸10 = max(𝐸9 + 𝐷910 , 𝐸5 + 𝐷510 ) = 89 + 1 = 90
Node 11: Set 𝐸11 = max(𝐸5 + 𝐷511 , 𝐸10 + 𝐷1011 ) = 90 + 1 = 91
Node 12: Set 𝐸12 = max(𝐸11 + 𝐷1112 ) = 91 + 1 = 92

84
OR: Ch5 Network Model
2. Compute Earliest And Latest time
Node 12 : Set 𝐿12 = 92
Node 11 : Set 𝐿11 = 𝐿12 + 𝐷1112 = 92 − 1 = 91
Node 10: Set 𝐿10 = 𝐿11 + 𝐷1011 = 91 − 1 = 90
Node 9: Set 𝐿9 = min(𝐿10 + 𝐷109 ) = 90 − 1 = 89
Node 8: Set 𝐿8 = min 𝐿9 + 𝐷98 = 89 − 1 = 88
Node 7: Set 𝐿7 = min 𝐿8 + 𝐷78 = 88 − 14 = 74
Node 6: Set 𝐿6 = min(𝐿9 + 𝐷69 ) = 89 − 1 = 88
Node 5: Set 𝐿5 = min(𝐿9 + 𝐷95 , , 𝐿6 + 𝐷69 , 𝐿7 + 𝐷57 ) = 19
Node 4: Set 𝐿4 = min 𝐿5 + 𝐷45 = 19 − 3 = 16
Node 3: Set 𝐿3 = min 𝐿4 + 𝐷34 = 16 − 0 = 16
Node 2: Set 𝐿2 = min(𝐿4 + 𝐷24 , 𝐿3 + 𝐷23 ) = 16 − 14 = 2
Node 1: Set 𝐿1 = min 𝐿2 + 𝐷12 = 2 − 2 = 0

85
OR: Ch5 Network Model
3. Determine Critical and noncritical activity

Critical activity noncritical activity

A F
B J
C H
D I
E K
M L
N G
O

86
OR: Ch5 Network Model
4. Determine Critical Path
1 → 2 → 3 → 4 → 5 → 9 → 10 → 11 → 12
1 → 2 → 4 → 5 → 9 → 10 → 11 → 12

87
OR: Ch5 Network Model
4. Determine TF and FF table and comment on it.

Noncritical Duration TF=𝐿𝑗 − 𝐸𝑖 − 𝐷𝑖𝑗 FF=𝐸𝑗 − 𝐸𝑖 − 𝐷𝑖𝑗

activity
F(5,6) 14 88 − 19 − 14 = 55 33 − 19 − 14 = 0
J (5,7) 7 74 − 19 − 7 =48 26 − 19 − 7 = 0
H (5,10) 1 90−19−1 = 70 90−19−1 = 70
I (5.11) 7 91−19−7 = 65 91−19−7 = 65
K (7,8) 14 88−26 − 14 = 48 40−26 − 14 = 0
L (8,9) 1 89−48 − 1 = 40 89−48 − 1 = 40
G(6,9) 1 89−33 − 1 = 55 89−33 − 1 = 55

88
OR: Ch5 Network Model
The computations red-flag activities F , J and K because their F F < T F. The
remaining activities have F F = T F, and hence may be scheduled anywhere
between their earliest start and latest completion times.
Turning to red-flagged activities F , J and K , we note that its FF = O. This means
that any delay in starting F , J and K past its earliest start time (= 0) must be
coupled with at least an equal delay in the start of its successor in all activities.

89
OR: Ch5 Network Model
Any Question

90
OR: Ch5 Network Model