Professional Documents
Culture Documents
Operation Research II
Prepared By:
Jomari Gingo
BSIE 4-1
CPM/ PERT
Network-based methods design to assist
planning, scheduling and control of time
consuming project.
Provides analytic mean for scheduling the
activities.
Use to know bottlenecks and critical activities
Phases for Project Planning with
CPM/PERT
Define Network
Network Time
Project Scheduling
Calculation
Activities
Defining Project Activities
CPM
Assumes deterministic activity duration.
PERT
Assumes probabilistic duration. The time to
perform each activities appears uncertain and as
such thru time estimate is needed as (optimistic,
pessimistic and most likely) are used,
Defining Project Activities
PERT
Optimistic time- denoted as a, which occurs when
execution goes extremely well.
Most Likely time- denoted as m, which occurs
when execution is done under normal condition.
Pessimistic time- denoted as b, which occurs
when execution goes extremely poorly.
Defining Project Activities
PERT
Expected time
average of the time (optimistic, pessimistic, and most
likely
Expected time=
(a+4m+b)/6
Defining Project Activities
Other Concept
1. Critical Path- consist of the sequence of those events and connected
activities that require maximum time in the completion of the project it
is that path that takes the longest time. It is critical because it control the
completion date of the project.
2. Bottleneck activities-any delay in the completion of one or more of these
activities will cause delay in the completion of the activity.
3. Earlier Start Time (ES)- Beginning of the activity.
4. Earlier Finish Time (EF)- Sum of the earliest start time and estimated
time to perform the concerned activity.
5. Latest Finish Time (LF)- an activity that can finish without delaying the
project beyond its deadline on the assumption that all subsequent
activities are performed as planned.
6. Latest Start Time (LS)- is the difference between the latest finished time
and the estimated time for the activity to be performed.
Network
Legend for making Network:
Event Activity
ES and EF Dummy
LF and LS
Network
Network Representation Rule:
Rule 1: Each activity is represented by one, and only one arc.
Rule 2: Each activity must be identified by two distinct end
nodes.
Rule 3: To maintain the correct precedence relationship, the
following questions must be answered as each activity is
added to network.
1. What activities must immediately precede the current
activity?
2. What activities must follow the current activity?
3. What activities must occur concurrently with the current
activity?
Network
Using Dummy:
2
A C
A
1 2 B
B 1 3
A A B
C 1
1
D
C E
B 2
E
Network
Important note: In case of multiple activity
In ES and EF
Choose the largest value
In LS and LF
Choose the smallest value
Example 1: Activity Project
Activity a b m (a+4m+b)/6
A 1 2 3 2
B 1 2 3 2
C 1 2 3 2
D 1 2 9 3
E 2 3 10 4
F DUMMY 0
G 3 6 15 7
H 2 5 14 6
I 1 4 7 4
J 4 9 20 10
K 1 2 9 3
L 4 4 4 4
Example 1: Network
8 11
2 5 11
7 3 D=3
6 6
2
7
2 11
11
E=4 6 6 I=4
A=2 F=0
5 11
6
5 15 15
0 10
4 15 15
B=2 6 6 G=7
0 15
1 2 4 2 8 9
15
0 L=4
9
0 6 15
2 15
C=2 H=6
K=3
12
2 8
2 12
2 J=10 12
2 2 7
12
12
Example 1: Network Calculation
Activity ES LS EF LF Slack (LS- Critical
ES or LF- Path
EF)
A 0 5 2 7 5
B 0 4 2 6 4
C 0 0 2 2 0 YES
D 2 8 5 11 6
E 2 7 6 11 5
F DUMMY
G 2 8 9 15 6
H 2 6 8 12 4
I 6 11 10 15 5
J 2 2 12 12 0 YES
K 12 12 15 15 0 YES
L 15 15 19 19 0 YES
Example 1: Network Calculation
Note:
LS-ES and LF-EF are always equal and is
called slack