Selena is the Event Manager of Hard Rock Café’s Rockfest and she is tasked to organize the event and

finish the preparation at the earliest possible time. She was able to determine the sequence of activities
and the time in days needed to finish each activity. The Figures are summarized in the table.
When is she going to finish the project? What is the critical path?

Step 1: draw the network

Predecessor/
Activity Time (days) Description
s
A 18 Process Permits
B A 12 Organize team
C B 24 Book Performers
D A 20 Reserve venue
E C 10 Invite Sponsors
F C 22 Advertise
G D, F 14 Sell Tickets
Conduct and Evaluate
H E, G 16
the Concert

Step 2: develop the critical path table

1. Do the forward pass with the earliest start (Se) and the earliest finish (Fe) based on time (t)

Se = maximum Fe of predecessor/s or 0 if none

Fe = Se + t

Activity A: Se = 0 Fe = 0 + 18 = 18
Activity B: Se = maximum (18) = 18 Fe = 18 + 12 = 30
Activity C: Se = maximum (30) = 30 Fe = 30 + 24 = 54
Activity D: Se = maximum (18) = 18 Fe = 18 + 20 = 38
Activity E: Se = maximum (54) = 54 Fe = 54 + 10 = 64
Activity F: Se = maximum (54) = 54 Fe = 54 + 22 = 76
Activity G: Se = maximum (38,76) = 76 Fe = 76 + 14 = 90
Activity H: Se = maximum (64,90) = 90 Fe = 90+ 16 = 106
2. Do the backward pass with the latest start (Sl) and the last finish (Fl) based on time (t)

Fl = maximum Sl of successor/s or maximum Fe if none

Sl = Fl + t
Activity H: Fl 106 Sl = 106 - 16 = 90
Activity G: Fl = minimum (90) = 90 Sl = 90 - 14 = 76
Activity F: Fl = minimum (76) = 76 Sl = 76 - 22 = 54
Activity E: Fl = minimum (90) = 90 Sl = 90 - 10 = 80
Activity D: Fl = minimum (76) = 76 Sl = 76 - 20 = 56
Activity C: Fl = minimum (80,54) = 54 Sl = 54 - 24 = 30
Activity B: Fl = minimum (30) = 30 Sl = 30 - 12 = 18
Activity A: Fl = minimum (18,56) = 18 Sl = 18 - 18 = 0

3. Compute the slack and determine the critical activities

Slack = Fl — Fe
= critical if 0, not critical if otherwise

Activity A: = 18 - 18 = 0 = critical
Activity B: = 30 - 30 =0 = critical
Activity C: = 54 - 54 = 0 = critical
Activity D: = 76 - 38 = 38 = not critical
Activity E: = 90 - 64 = 26 = not critical
Activity F: = 76 - 76= 0 = critical
Activity G: = 90 - 90= 0 = critical
Activity H: = 106 - 106 = 0 = critical
Predecessor/ Time Earliest Earliest Latest Latest Critical
Activity Slack
s (days) Start Finish Start Finish Path?
A 18 0 18 0 18 0 YES
B A 12 18 30 18 30 0 YES
C B 24 30 54 30 54 0 YES
D A 20 18 38 56 76 38 NO
E C 10 54 64 80 90 26 NO
F C 22 54 76 54 76 0 YES
G D, F 14 76 90 76 90 0 YES
H E, G 16 90 106 90 106 0 YES

Critical path
=A+B+C+F+G+H
= 18 + 12 + 24 + 22 + 14 + 16
= 106

The earliest time to finish the project is 106 days.

Step 3: draw the critical path
Predecessor/ Time
Activity Description
s (days)
A 18 Process Permits
B A 12 Organize team
C B 24 Book Performers
D A 20 Reserve venue
E C 10 Invite Sponsors
F C 22 Advertise
G D, F 14 Sell Tickets
Conduct and
H E, G 16
Evaluate the Concert

Thus, the earliest time to finish the

project is 106 days.