|
|

 


à
  
 
   


 



By analyzing the network, the planning, scheduling and

controlling becomes much easier.

CPM & PERT are most important techniques of network analysis

Generally, these techniques are used to handle very large &

complex projects like
Construction of a residential complex
Ships & aircraft projects
Development of new drug
Satellite development
Implementation of computer system
Designing & laying of a manufacturing plant ------& many more
 
This phase involves setting the objectives of the project and
the assumptions to be made. Also it involves the listing of
tasks or jobs that must be performed to complete a project
under consideration. In this phase, men, machines and
materials required for the project in addition to the estimates
of costs and duration of the various activities of the project
are also determined.


[ This consists of laying the activities according to the
precedence order and determining.

[ The start and finish times for each activity

[ The critical path on which the activities require

special attention

[ The slack and float for the non-critical paths.


This phase is exercised after the planning and scheduling,
which involves the following:

[ Making periodical progress reports

[ Reviewing the progress

[ Analyzing the status of the project

[ Management decisions regarding updating , crashing

and resource allocation etc.
   

CPM & PERT helps in developing the overall layout of the project with
estimate of time and resource required & scheduling of timing and
sequencing of various jobs to be performed.

These techniques help the project managers to

determine the expected project completion date,
The schedule start and completion time for the different
activities of project
The key activities of the project which must be completed at
the scheduled time
The period by which non-key activities may be delayed
without causing a delay in the completion of the whole project
-  

u
 u

u
  

      

 

     

 
    
       
      

 
 

 
    
    


  
     
      
 
 


u   


    u   




  
    
 
  






  
  

 !
"

The initial step in PERT/CPM project scheduling process is

determination of all specific activities that comprises the
project and their interdependence relationship.

Now, these activities portrayed by a network or an arrow

diagram
!|!|#
Each of the activities that make up a project consumes time and resources and has
a definable beginning and ending are represented by an arrow.

The circle at the beginning and at the end of the arrow represent the nodes or
events of beginning and completion, respectively. The events are points in time
and can be considered as milestone of a project.

Whereas an activity is a recognizable part of project, involving mental or

physical work and requiring time and resources for its completion; an event
connotes an accomplishment occurring at an instantaneous point in time which
neither requires any time for itself nor consumes any resources.

!!"! 


!! 
!! 
!|#!
 #        
 

 

  

 $
    
          

  
  % 
   





     
" %  
  
  

   & 
 

  
 
' %  

 
       
 
 
% 
      
        
(  )

   
      
  
    ( 

)    
* #       
 
+ %        
 
     
     ,
-



 

 

   
   

-$$%&%
´ . 


      
 
 head     
   
   

   
 %



 

 






$ $ "
"
Ë /

  
     
 &
   $  $   
  
   



$ "
 '$"
à

 


u 


 ,
$
" *
$ 1

 ´


 $ 
0
# ' +
#
, 
0 #
1 ,0

$%!!
We shall use the following notation for basic scheduling
computations:
(i, j) = Activity (i, j) with tail event i and head
event j.
Tij = Estimated completion time of activity (i, j)
Esij = Earliest starting time of activity (i, j)
Efij = Earliest finishing time of activity (i, j)
Lsij = Latest starting time of activity (i, j)
Lfij = Latest finishing time of activity (i, j)
  !!$"!
Before starting computations, the occurrence time of the initial
network event is fixed. The forward pass computation yields
the earliest start and earliest finish time for each activity (i, j)
and indirectly the earliest occurrence time for each event
namely Ei . This consists of the three steps.



  The computations begin from the start node and move
towards the end node. Let zero be the starting time for the project.


  Earliest starting time (ES)ij = Ei is the earliest possible time

when an activity can begin assuming that all of the predecessors
are also started at their earliest starting time. Earliest finish time of
activity (i, j) is the earliest starting time + the activity time.
(EF)ij = (Es)ij + tij


  Earliest event time for event j is the maximum of the earliest

finish time of all the activities ending at that event.

# 2!3-!4# 5!6
 "
*
8 *

$! 0!' 7!+

 "  ´
89 8 8* 

1!+
' +
8´'

,
 !u #:!!#,
# !!$"!
The latest event time (L) indicates the time by which all activities
entering into that event must be completed without delaying the
completion of the project. These can be calculated by reversing
the method of calculations used for earliest event time.
 


 For ending event assume E=L.

 Latest finish time for activity (i, j) is the target time for
completing the project.
(Lfij) = Lj

 Latest starting time of the activity (i, j)
= latest completion time of (i, j) ± the activity time
Lsij = Lfij ± tij
= Lj ± tij

 Latest event time for event I is the minimum of the latest start
time of all activities originating from the event.
Li = Min (Lj ± tij)
 "
*
8'

$! 0!' 7!+

 "  ´
89 8 + 8+ 

1!+
' +
8

$ !u /:!!/,