A project consist of the following activities and estimated time as shown below.

a.) Construct a network diagram

b.) Determine the project completion time and critical path

Most
Intermediate Optimistic Pessimistic Expected
Activity Probable
Predecessor Time (To) Time (Tp) Time (Te)
Time (Tm)
LEGEND:
A - 5 6 18 8 ES Earliest Start
B A 8 8 19 10 EF Eartliest Finish
C A,B 3 5 12 6 LS Latest Start
D B,C 6 9 14 9 LF Latest Finish
E D 3 4 10 5
F E 3 3 9 4 ACT
A
START
Te = (To+4Tm+Tp)/6 8
Te
Activity A A = (5 + 4x6 +18) / 6 = 7.83 or 8
Activity B B = (8 + 4x8 +19) / 6 = 9.83 or 10 ACTIVITY ES LS
Activity C C = (3 + 4x5 +12) / 6 = 5.83 or 6 A 0 0
Activity D D = (6 + 4x9 +14) / 6 = 9.33 or 9 B 8 8
Activity E E = (3 + 4x9 +10) / 6 = 4.83 or 5 C 18 18
Activity F F = (3 + 4x3 + 9) / 6 = 4.00 or 4 D 24 24
E 33 33
Solution Notes: F 38 38

A.) For the first Activity or Activity A, the earliest start (ES) is always equal
to 0 CRITICAL P
A
B.) 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 A
shown in slide number 3. A
C.) Earliest finish (EF) for Activity A is Te + ES, thus, 8+0 = 8
E.) For Activity B, the ES is the EF of the preceeding activity A, thus, 8
F.) For Activity B, the EF is Te+ES, thus, 10+8 = 18
G.) 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.
H.) 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 LS by the Te to get the EF. For F, it is
computed as 42-4=38.
I. ) The LS of F is the LS of G, thus 38. The procedure is similar for all the
other backward pass.
ND:
Earliest Start
Eartliest Finish ACT ES EF
Latest Start B 8 18
Latest Finish 10 8 18
Te LS LF
ES EF ACT ES EF ACT ES EF ACT ES EF ACT ES EF
0 8 C 18 24 D 24 33 E 33 38 F 38 42
0 8 6 18 24 9 24 33 5 33 38 4 38 42
LS LF Te LS LF Te LS LF Te LS LF Te LS LF

ST EF LF ST Using the normal time, crash the project for five days. Below are the information.
0 8 8 0
0 18 18 0 Crash Period
Normal Time Crash Time
0 24 24 0 ACTIVITY
(Te) (CT)
Available Day
0 33 33 0 (Te - CT)
0 38 38 0 A 8 5 3
0 42 42 0 B 10 7 3
C 6 2 4
CRITICAL PATHS D 9 6 3
B D E F E 5 3 2
C D E F F 4 1 3
B C D E F
PERIOD
PATH n=0 1 2 3 4
A,B,D,E,F 36 35 34 33 32
A,C,D,E,F 32 31 30 29 28
A,B,C,D,E,F 42 41 40 39 38
ACTIVITY CRASHED D D D F
COST 1,000 1,000 1,000 2,000
 END

are the information.

Cost/Day

11,000 The activity to crash in day 1 is D because it has the lowest

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

D
5 PROJECTION TIME (n=0)
31 A B D E F : 8 10 9 5 4 = 36
27 A C D E F : 8 6 9 5 4 = 32
37 A B C D E F : 8 10 6 9 5 4 = 42
F
2,000 How much will it cost the company to crash five days off
the estimated project completion time? Php 7000