Sunteți pe pagina 1din 30

| |

| |
     
 

|  |   


The CPM Diagram

r 3   r 3      


¦ 3     
¦ 3     
DEFINITION OF TERMS IN A NETWORK
r     any portions of project (tasks) which required
by project, uses up resource and consumes
time ʹ may involve labor, paper work,
contractual negotiations, machinery operations
Activity on Arrow (AOA) showed as arrow, AON
ʹ Activity on Node
r    beginning or ending points of one or more
activities, instantaneous point in time, also
called ͚nodes͛
r N   u Combination of all project activities and the
events
|  NG SU SSO
 !

N

[
For Analysis Determineu

r Tail Event and Head Event


r Earliest Start, Earliest Complete
r Latest Start, Latest Complete
r Critical / Non-Critical Status
r Total Float, Free Float
Calculating Earliest Occurrence And Latest Allowable
Time Of An Event
For this, following two methods are discussedu

A)Ô  "   #$       %


In this method calculation begin from event1, proceed through the events in
the increasing order of event numbers and end at initial event. At each event
we calculate the earliest occurrence time(E)and earliest start and finish time
for each activity. when calculations end at the final event it gives the earliest
possible completion time of the project.

B)&  "   #$     '    %


Here calculation begins from the final event, proceed through the events in
the decreasing order of event numbers and end at initial event1. At each
event we calculate latest occurrence time (L) and latest finish and start time
for each activity.
Earliest start & earliest finish time

r We are interested in the longest path through the network, i.e.,


the critical path.

r Starting at the network͛s origin and using a starting time of 0,


we compute an Ô Ô  (ES) and Ô Ô (EF) time
for each activity in the network.

r The expression EF = ES + t can be used to find the earliest finish


time for a given activity.
For example, for activity A, ES = 0 and t = 5; thus the earliest
finish time for activity A is
EF = 0 + 5 = 5
Arc with ES & EF time

  


  


 


   




Latest start & latest finish time

r To find the critical path we need a backward pass calculation.

r Starting at the completion point and using an approx  Ô


 time (LF) of 26 for an activity , we can trace back through the
network computing a  Ô  (LS) and latest finish time
for each activity

r The expression åSåÔ( can be used to calculate latest start


time for each activity. For example, for activity I, LF = 26 and t
= 2, thus the latest start time for activity I is
LS = 26 ʹ 2 = 24

ƒ
 



  


  


 


  

  


š
Slack or Free Time or Float

    


 
 
  
 
       
  
 
  !     
 
 !
  " 

     #
$%

Y  Y Y
   

å  

å

  

å 
  


Forward Passu
Determine Earliest Start (ES) and Earliest Complete
(EC)
for each Task

r For all Initial Tasks, ES = 0


r Once ES is Determined, EC = ES + Task Duration (TD)
r The ES for all tasks with tail [i] is equal to the largest value of
EC for all tasks with head [i].
r Project Complete (PC) is the largest value of EC for all Final
Tasks.
Backward Passu
Determine Latest Start (LS) and Latest Complete (LC)
for each Task

¦ For all Final Tasks, LC = PC


¦ Once LC is Determined, LS = LC - TD.
¦ The LC for all tasks with head [j], is equal to the smallest value
of LS for all tasks with tail [j].
¦ At least one Initial Task must have LS = 0; none may be
negative.
Determine Total Float (TF)u
Allowable delay in start of task which will not delay
Project Completion

For each activity(i,j)the total float equal to latest allowable time


for the event at the end of the activity minus the earliest time
for an event minus the activity duration.
Ô
#å
) %) 

Determine Free Float (FF)u


Allowable delay in start of task which will not delay
start of any other task.

It is the time by which completion of the activity can be


delayed without causing any delay in its immediate
successor activities.
ÔÔ
#
) %) 

Determine Critical Path

r All Tasks with zero Total Float are Critical.


r Any delay in these Tasks will delay Project
Completion.
r Darken these Tasks to finish CPM Diagram.
Activity schedule for example
  
  
  
  
  
 


"% 
"%  "%  "% "&% 


 ' ' # # ' (


) ' * * +, *
# $ - +, !
. # / $ +' ,
 # # * * ' (
 * * +' +' ' (
0 +' +' ,1 ,1 ' (
2 - +, ,+ ,1 !
3 ,1 ,1 ,* ,* ' (

|ON*U SONS
r G   
    

È ,*   

 
      

r G   


 
   


È 
  



r G 
 critical  
 
  
    
 
È 


 40
3

r Î
R Rcritical 
  

   
D
  
È 
 


  

 
 


"    $Ô  #S %  | 

+ 
  
   

 


 

 
 
   
   

, 

 
 5  
   
 6 

 

 

   



! 

         

1 3

  

           
           
  


"    $Ô  #S %  | #  %

# 
          
 

 
 
  
  
 3

 
   


    
  
  

   
 

* 3
        
   


 

/ .͛
   & 

     
   

$ 3  
 
     
   
& 

   



| Ô  +, U   
r 
 
  
 
  
  

r  
 
      7
   
    
     

r 8 !  

ë      
  
     
 
      
 


Y 
Y"
919%:*
 
"";
%:*% ,
 <7=">%

>
|   |
   
Immediate Optimistic Most Likely Pessimistic EXP Var S.Dev
Activity Predecessor Time Time Time TE V G

a - 10 22 22 20 4 2
b - 20 20 20 20 0 0
c - 4 10 16 10 4 2
d a 2 14 32 15 25 5
e b,c 8 8 20 10 4 2
f b,c 8 14 20 14 4 2
g b,c 4 4 4 4 0 0
h c 2 12 16 11 5.4 2.32
I g,h 6 16 38 18 28.4 5.33
j d,e 2 8 14 8 4 2

>
  "   

d
>
(15,25)
j
a (8,4)
(20,4) e
(10,4)
 f 
[
b (14,4)
(20,0)
g
c
(4,0)
(10,4) i
(18,28.4)
h 

(11,5.4)

>>
  | #| %
    
 
   

è  

  

!    

 > > 

 >š > š

 > > 

   

 > > 

    

>[
  |   N  

Y  
d
>
a (15,25) j
(20,4) (8,4)
b e
 
(20,0) (10,4)
f CRIT. TIME = 43
 [ 
(14,4)
g
c (4,0)
(10,4) i
(18,28.4)
h 

(11,5.4)
 

>
  ?@         
 
A

  
  

  B


 C

O !
Y  "
#$%
&$'(#')*+%*'&#'*++
O#$, *+!#-.*#
+,, 

 
 

  O(-&&"$-)))



>
A

  
-#D   

C
 
 
 '-# +*1#

.9#/1#"+*1#%
1!9-1#
#,1#


=   
-#  
     #,1#

 

>
 " &  || 
„  Y
+ 8   

  
 

  



  
 
 ?@
  
   
  
, 8  
 
 7 5 ! 
 



 



 

! 8   
  
  8   
  
 
   
 

    
8
 
  


1 @6     


 @  
   

      


# 
 4        
 43  
  
  
        

   


>
AYY/„ ! YYG/

„     "


"  "

   
-

r       



  

 

  

r 2     
    
  

  

r .          


 

r 3   &
 

  

 
     


AYY/„ ! YYG/
-

r .    
  
 
  
 
    
      
   

r   


     
 

      

r   


 
 

   
 
 


Parul Mathur
Roll no - 068

S-ar putea să vă placă și