SEMINOR

ON
CRITICAL PATH METHOD
FOR
PROJECT MANAGEMENT

Presentation By
GANGADHAR JADI
(07IM6008)
CONTENTS:-
CONTENTS

INTRODUCTION.
STEPS IN CRITICAL PATH METHOD.
NETWORK REPRSENTATION.
NUMBERING OF EVENTS.
TIME ANALYSIS.
SLACK.
DRAWING OF CRITICAL PATH.
EXAMPLE .
CONCLUSION.
REFERENCES .
INTRODUCTION:-
A project defines a combination of interrelated
activities which must be executed in a certain order
before the entire task can be completed.
the activities are interrelated in a logical sequence.
it is essential to manage effectively the project
through proper planning ,scheduling ,and control.
network scheduling is a technique used for planning
and scheduling large projects.
CPM, PERT are the basic planning and control
techniques.
STEPS IN CRITICAL PATH
METHOD:-
Planning.

Scheduling.

Controlling.
NETWORK REPRESENTATION:-

 (A) ACTIVITY:- An activity is a

physically identifiable part of the
project.

Tail Head
 NETWORK REPRESENTATI0N
(condt….)

 (B) EVENT:- An event represents the

start or the completion of an activity.

EVENT
ACTIVITY

BRUST EVENT

MERGE EVENT
 NETWORK REPRESENTATI0N
(condt….)
 (C) PREDECESSOR AND SUCCESSOR
ACTIVITIES:
 Predecessor activity:
 Activities that must be completed
immediately before the start of another
activity.
 Successor activities:
 activities which have to follow the activity
under consideration.
 NETWORK REPRESENTATI0N
(condt….)

D
B
F
A
C
E
 NETWORK REPRESENTATI0N
(condt….)
 (D) DUMMY ACTIVITY: An activity
depicts the dependency or relationship
over the other but does not consume
the time or resource.
A C
A C
O
B D
D B
 NETWORK REPRESENTATI0N
(condt….)

(E)Numbering of events(Fulkerson I-J rule):

 The Initial event which has all outgoing
arrows no incoming arrow is numbered 1
 Delete the all arrows coming out from one
node this will converts some more nodes
into initial events number 2,3…….
 NETWORK REPRESENTATI0N
(contd….)
Numbering of events
3 D
B
F
A 5 6
1 2
C
E
4
TIME ANALYSIS IN CRITICAL PATH
METHOD:-

The time analysis in network is done for:-

 Determine the completion time of project

 Earliest time when each activity can start
 Latest time when each activity can start
without delaying the total project
 Determining slack for each activity
 Identification of critical activities and
critical path
 TIME ANALYSIS IN CRITICAL PATH
METHOD(CONTD….)
Forward pass computations (earliest event time):
 Earliest occurrence Ei=earliest time of event I
time for each event (Es)ij=earliest starting
Step1: the computations time of activity i,j
begins from start node Dij=duration time of
and move towards the activity i,j
end node. Assume (Ef)ij=earliest finish time
earliest occurrence of activity i,j
time for initial event is Ej=earliest time of event j
zero
Step2:(Es)ij=Ei
(Ef)ij=Ei+Dij
Ej=max(Ei+Dij)
 TIME ANALYSIS IN CRITICAL PATH
METHOD (Contd….)
Backward pass computation (latest event time):-
 Latest event time
indicates the time by
which all activities (Lj)=Latest time of event
entering into that event j
must be completed
without delaying the total (Lf)ij= Latest finish time
project completion time of activity I,j
Step1:for ending event (Ls)ij= Latest starting
assume E=L time of activity I,j
Step2:(Lf)ij=Lj (Li)= Latest time of
Step3:(Ls)ij=Lj-Dij event i
Step4:(Li)=min((Lf)ij-Dij)
SLACK:-
 Slack of an event is difference
between the latest time and earliest
time of an event
slack=Li-Ei (for tail event)

slack=Lj-Ej (for head event)

DRAWING OF CRITICAL
PATH:-
 Draw the path which is connected all
the zero slack events.
 The activities in the critical path is
critical activities.
 Delay in the critical activity affect the
total completion time of the project.
EXAMPLE:-
Activity Predecessors Duration(Weeks)
A _ 4
B A 3
C A 2
D B 5
E B 3
F C,D 4
G E,F 3
Example (contd…..)
Network diagram:
E 5
3 10 16
3
7 7 D D2
B 5 6 7 8
3 F G
1 2 12 12 16 16 3 19 19
A 4 4 D1 4
0 o 4 C 4
2
6 12
 Example (contd…..)
Computation of slack:

activity duration Es Ef Ls Lf slack

A 4 0 4 0 4 0
B 3 4 7 4 7 0
C 2 4 6 10 12 6
D 5 7 12 7 12 0
E 3 7 12 13 16 6
F 4 12 16 12 16 0
G 3 16 19 16 19 0
Example (contd…..)
Critical path:
E 5
3 10 16
3
7 7 D D2
B 5 6 7 8
F G
2 3 12 12
1
A 4 16 16 3 19 19
0 0 4 4 D1
C
4 4
2
6 12

Critical path: A-B-D-F-G

CONCLUSION:-
 Graphically displays project activities
 Estimates how long the project will
take
 Indicates most critical activities
 Show where delays will not affect
project
 REFERENCES:-
 S.D.SHARMA ”Operations research” Kedar Nath
Ram Nath&co,meerut,2006,pp-316-329.
 MARTAND TELSANG” Industrial engineering and
production management” S.Chand, 2005, pp-285-
292.
 A.TAHA ”Operations Research” Macmillan
Publishing co.,1982,pp-458-468.
 http://en.wikipedia.org/wiki/Critical_path._28_Aug07
.
THANK YOU…