Software Engineering

- Sahil Kohli, Trainer

1
Project Scheduling and Tracking
• Scheduling is the process of deciding:
• In what sequence a set of activities will be performed.
• When they should start and be completed.
• Tracking is the process of determining how well you are sticking to the
cost estimate and schedule.

2
PERT Charts
• A PERT chart shows the sequence in which tasks must be completed.
• PERT = Program Evaluation and Review Technique
• In each node of a PERT chart, you typically show the elapsed time and effort
estimates.
• The critical path indicates the minimum time in which it is possible to
complete the project.

3
Example of a PERT Chart

4
Gantt Charts
• A Gantt Chart is used to graphically present the start and end dates of
each Software Engineering task.
• One axis shows time.
• The other axis shows the activities that will be performed.
• The black bars are the top-level tasks.
• The yellow bars are subtasks.
• The diamonds are milestones:
• Important deadline dates, at which specific events may occur.

5
Example of a Gantt Chart

6
 Two Types of Gantt Charts
Person-Centered View Activity-Centered View
To determine people‘s load To identify teams working together on the same tasks

RAM A1 A2 A3 A1 RAM, MANSI

RIYA
A2 RAM
MANSI A1 A3

A3 RAM, MANSI, RAHUL

Time Time

Choose one view, stay with it. Usually base the view on the WBS structure Managing Experienced Teams:
1. Person-centered view
2. Managing Beginners: Activity oriented view
7
Critical Path Method
• Definition: In CPM activities are shown as a network of precedence
relationships using activity-on-node network construction
• Single estimate of activity time
• Deterministic activity times

• Critical Path:
• Is that the sequence of activities and events where there is no “slack” i.e..
Zero slack
• Longest path through a network
• minimum project completion time

8
Activity On-Node

9
10
CPM
A critical path is the longest path in the network. Each node which falls
under critical path has zero or negative float (Slack).
There are 3 steps to calculate CPM:
1. Forward Pass - To calculate the Early Start(ES) and Early Finish(EF) of node.
2. Backward Pass - To calculate Late Start (LS) and Late Finish(LF) of node.
3. Calculate Float and Thus CPM.

11
12
The Forward Pass
Node A
The activity starts on day zero, since A activity duration is for 5 days,
the early finish will take Early Start and duration i.e.:
A(EF) = A(ES) + Duration
A (EF)= 0 + 5 = 5
Node B
Since there is only one node which precedes activity B. The relationship
is F->S. That means that activity B can start only when activity A ends.
Hence
B (ES) = A (EF) = 5
B(EF) = B(ES) + Duration = 5+ 5 = 10
Activity C: C(ES) = B(EF) = 10, also C(EF) = C(ES) + Duration = 10+ 4 = 14
13
Forward Pass Calculations

14
Calculation for Backward Pass
Node H
Node H has only one node preceding it in backward pass (node Z). Hence
H(LF) = Z(LS) = 28
H(LS) = H(LF) – H(Duration) = 28 – 8 = 20
Node E
Node E has only one node preceding it in backward pass (node Z). Hence
E(LF) = Z(LS) = 28
E(LS) = E(LF) – E(Duration) = 28 – 10 = 18
Node C
Node C has only one node preceding it in backward pass (node Z). Hence
C(LF) = C(LS) = 28
C(LS) = C(LF) – C(Duration) = 28 – 4 = 24
15
More then one Forward Node
Node B
Since Node B is where most of the activities are merging in backward
pass i.e. C, D and G, this is where we need to pay more attention. In
backward pass the node B’s Latest Finish (LF) would be earliest or all
the nodes Late Start i.e.
B(LF) = Least | C(LS) or D(LS) or G(LS)|
B(LF) = Least | 24 or 10 or 18|
B(LF) = 10
B(LS) = B(LF) – B(Duration) = 10 -5 = 5

16
Backward Pass Calculation

17
Calculating Total Float or Slack
Total Float
Total amount of time that a schedule activity may be delayed from its
early start date without delaying the project finish date, or
intermediary milestone. It is calculated using:
Activity (ES) – Activity (LS) or activity (EF) Activity(LF) – Both will
give you same results.
Free Float
This is an amount of time that a schedule activity can be delayed
without delaying the early start of any immediately following schedule
activities. E.g. – For activity C
C (Total Float) = C (LS) - C(ES) = 24 – 10 = 14
C (Free Float) = ES of next activity – C(EF )
C (Free Float) = Z(ES) – C(EF ) = 28 -14 = 14
18
Critical Path
üThe Critical Path
üCalculate the Total float for all activities as per the formula.
üAll nodes which have zero or negative float/slack forms the CRITICAL PATH.

19
A,B,D,E and Z forms the Critical Path

20
THANK YOU

Sahil Kohli, Trainer