2022-2023

Operations Research.

Lecture One
- Network Analysis
- Critical Path Method

Asst. Lect. Hiba Dhaher

University of Technology
Electrical engineering depart.
Central Ideas:
The basic purpose of a network analysis is to help managers schedule (‫ )جدولةت‬and
control (‫ )مراقبت‬large and complex projects (‫)المشاريع الكبيرة والمعقدة‬.

1- Components of a network diagram:

To begin work with the critical path, it is important to understand each part or
concept that applies when creating a chart.

- Node :( Places on a diagram indicating where events begin).

- The earliest start time: (the time at which an event can first begin).

The earliest time = start time first node + activity time between nodes

- The latest start time: it is the time during which an activity can be completed if it
starts early

The latest start time = earliest start time – activity time

- Slack time: The flexible time that an event has between its earliest event time and
latest event time.

2 4

1 6

3 5

- Node.

- Earliest time (EST).

- Latest time (LST).

- Activities.

1
Application Example:

Look at the following table:

activities start node end node activity time in week

A 1
B 1
C 1
D 4
E 3
F 2
G 5
H 6
2 11
3 3
4 10
5 3
5 1
6 2
6 1
7 1

Now let we Create the network diagram from Table above ,

- The first step is to set the node on the diagram

2 6 7

1
5
3

4
6
Figure (1)

- The second step is to set the activity time

2 1
2 6 7
6
11
1
3 1
1 3 5

10

Figure (2) 4 3

2
- The third step is to set the earliest start time

11+2=13
0+11=11 13+1=14 max 14+1=15
2 1
2 6 7
6
11
0+3=3 1
3 1
0
1 3 5 3+1=4
10+3=13 max

10
0+10=10

4 3

Figure (3)

The earliest start time = start time first node + activity time between nodes

- Note: if there are two activities, the value of the higher activity is taken.

EST (1) =0
EST (2) = 1+11=12
EST (3) = 1+3=4
EST (4) = 1+10=11
EST (5) =11+3=14 max
= 4+1=5
.
.
EST (7) = 15+1=16

- The fourth step is to set the latest start time

The latest start time = earliest start time – activity time

- Note: if there are two activities, the value of the lower activity is taken.

3
 12 14 15
2 1
2 6 7
6
11
12 1

0 3 1
1 3 5 13

10
10

4 3

Figure (4)

LST (7) =15

LST (6) = 15-1=14
LST (5) = 14-1=13
LST (4) =13-3=10
LST (3) =13-1=12
LST (2) = 14-2=12
LST (1) =12-11=1
=12-3=9
=10-10=0 min

11 14 15
12 14 15
2 1
2 6 7
6
11 3
12 1

0 3 1 13
0 1 3 5 13

10
10
10

4 3

Figure (5)

4
 earliest latest slack
Node
start time start time time
1 0 0 0-0=0
2 11 12 12-11=1
3 3 12 12-3=9
4 10 10 0
5 13 13 0
6 14 14 0
7 15 15 0

1-1 Critical Path Method (CPM)

CPM is the path through the diagram that will take the longest amount of time to
complete the project.
The critical path can be used to determine the most time-consuming path to show
what activities must be completed on a strict time frame and what activities have
slack time in their schedule.
The activities that have the same number for the earliest start time and latest start
time are the critical path nodes. Also, their slack event time will be zero.
Figure (6) below shows the final diagram with the critical path.

14 15
11
14 15
12
2 1
2 6 7
6
11 3
12 1

0 3 1 13
0 1 3 5 13

10
10
10

4 3

Figure (6)
- CP.

5
Example 2
A project has the following times schedule

Activity 1-2 1-3 2-4 3-4 3-5 4-9 5-6 5-7 6-8 7-8 8-9 8-10 9-10
time in 4 1 1 1 6 5 4 8 1 2 1 8 7
weeks

Construct network and compute:

1- EST.
2- LST.
3- CP.
4- Slack time for each activity and for CP.
Solution:
4 18
12 5 18
13 5
1
2 9
4
11
16 7
25
25
0 4
6 1
0 10
1 o0
1
1
4
8
6 8
1 3 5
⬚
⬚
17
1 7 17
1 8 2
7
7

15
15

EST (1) = 0+4=4

EST (2) = 4+1=5
EST (3) =0+1=1
EST (4) = 1+1=2
=4+1=5 max
.

6
.
.
.
EST (9) = 5+5=10
= 17+1=18 max
EST (10) = 18+7=17+8=25

LST (10) = 25
LST (9) = 25-7=18
LST (8) = 18-1=25-8=17
.
.
.
LST (3) = 5-1 =4
= 7-6 =1 min
LST (2) = 13-1=12
LST (1) = 12-4=8
= 1-1=0 min

CP = 1-3-5-7-8-9-10 = 1+6+8+2+1+7=25 week

CP Slack time =zero
Node EST LST Slack time
1 0 0 0
2 4 12 8
3 1 1 0
4 5 13 8
5 7 7 0
6 11 16 5
7 15 15 0
8 17 17 0
9 18 18 0
10 25 25 0

7
Example 3
Determine the early start and late start in respect of all node point and identify
critical path for the following network.
8 6
2 5 8
10 13

8 16 12
1
3 7 10
0
9

15
7 5 9
4 6

Solution:

10 18 24
10 18 24
8 6
2 5
8
0 10 13
8 24
0
9 25
8 16 13 37
1
3 7 10 37
0
10

15
7 5 9
4 6

22
17
10 22
17
10

CP1= 1-2-5-8-10=37

CP2=1-4-6-9-10=37

8
Problems
1- Determine the CP by using CPM of the following projects
a-
Duration
Activities Path
(week)
A 1-2 1
B 1-3 4
C 3-5 3
D 3-4 5
E 2-4 2
F 5-6 3
G 4-6 6
Solution: CP= 1-3-4-6

b-
Duration
Activities Path
(week)
A 1-2 2
B 2-3 3
C 3-4 8
D 3-5 5
E 5-6 4
Solution: CP=1-2-3-4(check it)

2- A project to manufacture a product is composed of the following activities:

Activities path Durations(Day)
A …… 6
B …… 9
C B 8
D A 7
E D 16
F C,E 12
Solution: CP=1-2-3-4-5-6(check it)

3- For the following network, determine the critical path. The duration of each
activity (in day) is shown on the arrows.
4 9
2 6
3 3
5 5 5
1 3 5 7 8
7 2 4

6
5 4
Solution: CP= 1-3-5-6-7-8-9