Software Project Management

CS-463
Course Instructor: Dr. Shafaq Mussadiq
Institute of Computing (IOC)
Kohat University of Science & Technology (KUST)

Software Project Management CS-463 Instructor: Dr. Shafaq

Mussadiq Institute of Computing, KUST
Topic: Program Evaluation and Review Technique (PERT)

Lecture’s Topic
• Scheduling Techniques
oProgram Evaluation and Review Technique (PERT) (Continued)
oCritical Path Method

Software Project Management CS-463 Instructor: Dr. Shafaq Mussadiq Institute of Computing, KUST
Topic: Program Evaluation and Review Technique (PERT)
𝐸𝑥𝑝𝑒𝑐𝑡𝑒𝑑 𝑇𝑖𝑚𝑒=𝑡𝑒
(𝑜 + 4𝑚 + 𝑝),
=
Example 6

Activity
A —
B —
C A
D A
E B, C
F D
G E
Time estimates
Predecessor
Opt. (o)
2 4
3 5
4 5
4 6
4 5
3 4
3 5
Expected time
Normal (m) Pess. (p)
6 4.00
9 5.33
7 5.17
10 6.33
7 5.17
8 4.50
8 5.17

Software Project Management CS-463 Instructor: Dr. Shafaq Mussadiq Institute of Computing, KUST
Topic: Program Evaluation and Review Technique (PERT)
Activity Predecessor
A —

Creating Network Diagram B

C
—
A
D A
E B, C
d F D
a f G E

Start c g Finish

b e

Software Project Management CS-463 Instructor: Dr. Shafaq Mussadiq Institute of Computing, KUST
Topic: Program Evaluation and Review Technique (PERT)

Node Information
• The activity name
• The expected time duration
• The early start time (ES): the maximum EF of all predecessor activities,
unless the activity is the first activity, for which the ES is zero (0).
• The early finish time (EF): ES + the task duration
• The late start time (LS): LF - the task duration
• The late finish time (LF): the minimum LS of all successor activities,
unless the activity is the last activity, for which the LF equals the EF.
• The slack

Software Project Management CS-463 Instructor: Dr. Shafaq Mussadiq Institute of Computing, KUST
Topic: Program Evaluation and Review Technique (PERT)
Activity Predecessor Expected ti
A — 4.00

Node Information B
C
—
A
5.33
5.17
D A 6.33
Nodes Early Start Early Finish Late Finish Late Start E B, C 5.17
Time (ES) Time (EF) Time (LF) Time (LS)
F D 4.50
Start 0 0 0 0
G E 5.17
a 0 4 4 0
b 0 5.33 9.17 3.84
c 4 9.17 9.17 4
d 4 10.33 15.01 8.68
e 9.17 14.34 14.34 9.17
f 10.33 14.83 19.51 15.01
g 14.34 19.51 19.51 14.34
Finish 19.51 19.51 19.51 19.51

Software Project Management CS-463 Instructor: Dr. Shafaq Mussadiq Institute of Computing, KUST
Topic: Program Evaluation and Review Technique (PERT)

Critical Path
• The critical path is the path that takes the longest to complete.
• To determine the path times, add the task durations for all available
paths.
• Activities that have slack can be delayed without changing the overall
time of the project.
• Slack is computed in one of two ways,
slack = LF − EF or
slack = LS − ES.
• Activities that are on the critical path have a slack of zero (0).

Software Project Management CS-463 Instructor: Dr. Shafaq Mussadiq Institute of Computing, KUST
Topic: Program Evaluation and Review Technique (PERT)

Critical Path
• The duration of path adf is 14.83 work days.
• The duration of path aceg is 19.51 work days.
• The duration of path beg is 15.67 work days.

The critical path is aceg and the critical time is 19.51 work days.
d
a f

Start c g Finish

b e

Software Project Management CS-463 Instructor: Dr. Shafaq Mussadiq Institute of Computing, KUST
Topic: Program Evaluation and Review Technique (PERT)

Software Project Management CS-463 Instructor: Dr. Shafaq Mussadiq Institute of Computing, KUST
Thank You