Tutorial 2: Project Management Activity Charts (PERT Charts)

Tutorial 2
Project Management
Activity Charts
(PERT Charts)
Activity Charts
• The Activity Network is sometimes called an
Arrow Diagram or PERT Chart, where PERT
stands for Programmed Evaluation Review
Technique.
• It’s a Project Management software, which
performs the critical path calculation, along
with other tasks such as leveling and cost
calculations.
Activity Network: How to understand
it
• A project is composed of a set of actions or
tasks.
• The Activity Network diagram displays
interdependencies between tasks through the
use of boxes and arrows.
• Arrows pointing into a task box come from its
predecessor tasks.
• Arrows pointing out of a task box go to its
successor tasks.
The Activity Network Diagram
Slack time & Critical path
• Slack time: The amount of time that a task can be
delayed without affecting the completion time of the
overall project is known as the slack time or float .
• Critical Path: The critical path through the diagram

is the sequence of tasks which have zero slack time.
Thus, if any task on the critical path finishes late,
then the whole project will also finish late
How can it PERT charts Help you?
• Finding minimum completion times
• Determining maximum completion times
• Value of time for each step in the project
•
Assigning specified times for parts of the
project
• Creates a realistic schedule for the company
The Critical Path and Slack
Network analysis example 1996 MBA
exam
A project consists of 8 activities. The activity completion times and the precedence
relationships are as follows:
Activity Completion time Immediate predecessor
(days) activities
A 5 -
B 7 -
C 6 -
D 3 A
E 4 B,C
F 2 C
G 6 A,D
H 5 E,F
• Draw the network diagram.
• Calculate the minimum overall project completion time and identify which
activities are critical.
• If activity E is delayed by 3 days how is the project completion time affected?
• If activity F is delayed by 3 days how is the project completion time affected?
Network Diagram
1
Calculate the minimum overall project
completion time
• Let Ei represent the earliest start time for activity i such that all its preceding
activities have been finished. We calculate the values of the E i (i=A,B,...,I) by
going forward, from left to right, in the network diagram.
• To ease the notation let Ti be the activity completion time associated with
activity i (e.g. TB = 7). Then the Ei are given by:
• EA = 0 (assuming we start at time zero)
EB = 0 (assuming we start at time zero)
EC = 0 (assuming we start at time zero)
ED = EA + TA = 0 + 5 = 5
EG = max[EA + TA, ED + TD] = max[0 + 5, 5 + 3] = 8
EE = max[EB + TB, EC + TC] = max[0 + 7, 0 + 6] = 7
EF = EC + TC = 0 + 6 = 6
EH = max[EE + TE, EF + TF] = max[7 + 4, 6 + 2] = 11
EI = max[EG + TG, EH + TH] = max[8 + 6, 11 + 5] = 16
• Hence the minimum possible completion time for the entire project is 16
days, i.e. 16 days is the minimum time needed to complete all the activities.
Calculate the latest times for each
activity
• Let Li represent the latest start time we can start activity i and still
complete the project in the minimum overall completion time. We
calculate the values of the Li (i=A,B,...,I) by going backward, from
right to left, in the network diagram. Hence:
• LI = 16
LG = LI - TG = 16 - 6 = 10
LH = LI - TH = 16 - 5 = 11
LD = LG - TD = 10 - 3 = 7
LA = min[LD - TA, LG - TA] = min[7 - 5, 10 - 5] = 2
LE = LH - TE = 11 - 4 = 7
LF = LH - TF = 11 - 2 = 9
LC = min[LE - TC, LF - TC] = min[7 - 6, 9 - 6] = 1
LB = LE - TB = 7 - 7 = 0
• Note that as a check all latest times are >=0 at least one activity has
a latest start time value of zero.
Calculate The Slack time
slack or float time Fi available is given by Fi = Li - Ei
• Activity Li Ei Float Fi
• A 2 0 2
• B 0 0 0
• C 1 0 1
• D 7 5 2
• E 7 7 0
• F 9 6 3
• G 10 8 2
• H 11 11 0
• Any activity with a float of zero is critical. Note here that, as a check, all float
values should be >= 0.
• Hence the critical activities are B, E and H and the floats for the non-critical
activities are given in the table above.
Solution
• If activity E is delayed by 3 days then as E is
critical the project completion time increases
by exactly 3 days.
• If activity F is delayed by 3 days then as F has a

float of 3 days the project completion time is
unaffected.
Example 2
• The project consists of 8 activities.
Activity Preceding Activity Expected Time(in
days)
1. Requirements _______ 5
Collection
2. Screen Design 1 6
3. Report Design 1 6
4. Data Base Design 2,3 2
5. User 4 5.5
Documentation
6. Programming 4 5
7. Testing 6 3
8. Installation 5,7 1
Network Diagram
• Activities as numbered in the table
2 8
5
1 4
6 7

Tutorial 2: Project Management Activity Charts (PERT Charts)

Uploaded by

Copyright:

Available Formats

Tutorial 2: Project Management Activity Charts (PERT Charts)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Tutorial 2: Project Management Activity Charts (PERT Charts)

Uploaded by

Copyright:

Available Formats

Tutorial 2

• Critical Path: The critical path through the diagram

• If activity F is delayed by 3 days then as F has a

You might also like