OPMANTQM

PERT-CPM
Sample Problem
A project consists of the following activities and estimated times as shown below.
a. Construct a network diagram
b. Determine the project completion time and critical path

Activity I. Predecessor Optimistic Time Most Probable Pessimistic Time Expected Time
(To) Time (Tm) (Tp) (Te)
A - 5 6 18 8
B A 8 8 19 10
C A,B 3 5 12 6
D B,C 6 9 14 9
E D 3 4 10 5
F E 3 3 9 4

Te = (To+4Tm+Tp)/6 , thus Te for A = (5+4*6+18)/6 = 7.83 or 8

PERT-CPM NETWORK
Solution Notes:
For the first Activity or Activity A, the earliest start (ES) is always equal to 0
The estimated times (Te) have been plotted below the Activity label. Notice that activity A has a Te of 8, which was
computed using the formula shown in slide number 3.
Earliest finish (EF) for Activity A is Te + ES, thus, 8+0 = 8
For Activity B, the ES is the EF of the preceeding activity A, thus, 8
For Activity B, the EF is Te+ES, thus, 10+8 = 18
For Activity C, the ES is 18 which is the EF of Activity B. Notice that Activity C is connected to both A and B. In cases
like this, and with a forward pass, the rule is to select the higher EF. EF of A is 8 while EF of B is 18. The higher
value is 18, and it will therefore be the ES of Activity C. In cases like this, and with a backward pass, the rule is
reversed. Thus , the lower value is selected between or among those items connected to the activity being
processed.
Using the same procedure, the computed EF for F is 42. It will also be used as the LF for F and begin the backward
pass by reversing the procedure, thus, subtracting the LF by the Te to get the LS. For F, it is computed as 42-4=38.
The LS of F is the LF of E, thus 38. The procedure is similar for all the other backward pass.
Sample Problem for CRASHING
Using the normal time, crash the project for five days. Below are the information:

Activity Normal Time Crash Time Available Day Cost/Day

(Te) (CT)
A 8 5 3 (Te less CT) 11,000

B 10 7 3 3,000

C 6 2 4 6,000

D 9 6 3 1.000

E 5 3 2 6,000

F 4 1 3 2,000
 Path n=0 1 2 3 4 5

A-B-D-E-F 36 35 34 33 32 31

A-B-C-D-E-F 42 41 40 39 38 37

A-C-D-E-F 32 31 30 29 28 27

Activity Crashed D D D F F

Cost 1000 1000 1000 2000 2000

The activity to crash in day 1 is D because it has the lowest cost to crash. It can also be crashed for 3 days
so it is still the lowest activity to crash for day 2 and 3. Deduct one day from the base time (n=0) whenever
the activity to crashed is among the activities in the path.