Professional Documents
Culture Documents
Chapter 6 Project Management 71
Chapter 6 Project Management 71
co
1
www.gradeup.co
6 PROJECT MANAGEMENT
1. INTRODUCTION
Project Management deals with both 'material' as well as 'human factors' to increase the
productivity.
Objectives of a Project:
• It should be completed in minimum time with minimum capital investment
• It should use available manpower and other resources optimally.
1.1. Phases of Project Management
1.1.1. Planning
Planning involves:
1. Defining objectives of the project.
2. Listing of jobs that have to be performed.
3. Determining gross requirements for materials, equipment’s and man power and
preparing estimates of costs and duration for various jobs.
4. To bring about the satisfactory completion of project.
1.1.2. Scheduling
Scheduling is the allocation of resources such as time. material, space, equipment and
human and technological effort.
It involves:
1. Finalizing the planned functions mechanically.
2. Assigning starting and completion dates to each activity to proceed in a logical
sequence and in a systematic manner.
1.1.3 Controlling
Controlling involves:
1. Determination of deviations from basic plan and their effects on the project.
• It should be noted that planning and scheduling are accomplished before the actual
protect starts while controlling is operative during execution of the project.
The method of planning and controlling that was originally developed was called Project
Planning and Scheduling (PPS). PPS was later on converted into Critical Path Method
(CPM), so the CPM involves the deterministic approach and is used for the repetitive types
of projects.
2
www.gradeup.co
3
www.gradeup.co
2. NETWORK METHODS
4
www.gradeup.co
(ii) Square
(iii) Rectangular
(iv) Oval
5
www.gradeup.co
Head Event
(i) When a tail event represents beginning of more than one activity, then the event is
said to occur when the first activity starts from it.
(ii) Similarly, when a head event occurs at end of more than one activity, the event is
said to have occurred only when all the activities leading to it are completed.
• Dual role events: All events except the first and the last event of a project are dual role
events. They have both incoming and outgoing arrows.
6
www.gradeup.co
• Successor events: The event or events that follow another event are called successor
events to that event.
Successor Events
e g.: Event 2 and 3 are successor events of event 1
• Predecessor events: The event or events that occur before another event are called
predecessor oven' to that event.
In above figure. events 2. 3 are predecessor to event 5
2.2.2. Activity
Activity is actual performance of a job. It requires lime and resources for its completion.
Following are examples elan activity:
1. Excavate trench
2. Mix concrete
3. Prepare budget
In A-0-A system (Activity On Arrow network system), activity is represented by arrows
between events while in A-O-N (Activity On Node system), activities are represented by
nodes. In A-0-N system, events have no places.
7
www.gradeup.co
• Similarly activities that are required to be performed before another activity can begin
are called predecessor activities to that activity. Activity (A) is predecessor activity to
activity D.
2.2.3. Dummy
• A dummy is a type of operation which neither requires time nor any resource, but it
denotes dependency among the activities.
• It is represented by dashed arrow.
In the figure shown below, a dummy activity is shown.
8
www.gradeup.co
7. Arrows should normally not cross each other. If it is necessary to cross, one should be
bridged over the other.
8. No activity can start until its tail event has occurred.
Fulkerson’s rule for numbering the events:
1. The single initial event is numbered as 0, 1, 10 etc.
2. All arrows emerging out of the initial event are neglected. Doing so, the created one
or more new initial events are numbered as 2,3,4 or 20, 30, 40 etc.
3. Step - 2 is repeated unless all events are numbered.
Errors in Network
1. Looping error: Loops should not be formed.
2. Dangling error:
Project is complete only when all its activities are complete but the duration of activity 'R
has no effect on the project time as shown in figure.
9
www.gradeup.co
To avoid dangling error, the network must be examined in such a manner that all events
except initial and final events must have at least one activity entering and one activity
leaving them.
3. Wagon wheel error: As shown in figure below, each of the activities P, 0 and R cannot
start until all the three activities A, B and C are completed. But in reality, this may not be
the situation. There is no error visible in the construction of diagram but logical error has
crept into it.
10
www.gradeup.co
11
www.gradeup.co
2 = 12 + 22 + 23 + ...... along critical path. Hence standard deviation of the project as a
whole
Time computation of Events: 1. Earliest Expected Occurrence Time (EOT): the limo at
which an event is expected to ow; earliest.
• The time at which on event can be expected to occur earliest.
• M event occurs when all the activities leading toil are completed.
• Ito generally denoted by TE It Is calculated by forward path.
(
TEj = TEi + tij )
max
(when Moro are more than one path)
Here.
12
www.gradeup.co
2. Latest Allowable Occurrence Time (LOT): The latest allowable time at which an event
must mar lo keep the project on schedule.
It is generally denoted by TL. This is calculated through backward path.
( )
TLi = TLi + tij ...(when there is only one path)
(
TLi = TLi + tij ) min
( ...when there are more than ono path)
Where
Ts Te
Z
13
www.gradeup.co
0 50.00
+1 84.13
+2 97.72
+3 99.87
–1 15.87
–2 2.28
–3 0.13
tp tp
6
This is based on deterministic approach in which only one time estimate is made for activity
completion. Network diagram in CPM is activity oriented.
⚫ It is activity oriented network
⚫ It is used for repetitive type of work and has deterministic approach.
14
www.gradeup.co
CPM
1. It is an activity oriented network.
2. It has deterministic approach. probability value approaches to one here.
3. Only one time is calculated I.e. activity duration “t”.
4. Time and cost are related by the following curve given from this curve optimum time
is derived which result in the minimum cost.
5. It is suitable for repetitive type of work where time and cost can be evaluated with fair
degree of accuracy.
15
www.gradeup.co
Examples:
⚫ Construction work,
⚫ Maintenance work,
⚫ Civil engineering projects.
4.2. Event Times in CPM
1. Earliest occurrence time (TE): Time at which an event may occurs early as possible.
2. Latest allowable time (TL): Time at which event may occur as late as possible without
delaying the overall project completion time.
These are similar to PERT and are calculated in the same fashion.
4.3. Activity times in CPM
1. Earliest start time(EST): It is the earliest possible time at which an activity can be
started.
For an activity i–j, earliest event time of event i, i.e. TEi is EST of activity i–j
2. Earliest finish time (EFT): It is the earliest possible time by which an activity can be
completed.
For an activity i–j
EFT = EST +tij = TEi + tij
tij = Activity duration
3. Latest start time(LST): This is the latest possible time at which an activity can be
started without delaying the overall project
∴ LST = LFT - Activity duration
∴ LST= TLi – tij
LFT = latest finish time of activity i – j = TLi
16
www.gradeup.co
4. Latest finish time (LFT): This is the latest time by which an operation or activity
must be completed without delaying the project.
For an activity i – j, latest allowable time of head event j, i.e. TLj is LFT of activity i–j.
Note: LST of an activity is to be calculated on the basis of latest occurrence time of its
head event and not on the brass of latest occurrence time of its tail event.
Float
⚫ It is associated with activity times
⚫ It is analogous to slack of event in PERT.
⚫ It is the range within which start or finish time of an activity may fluctuate without
affecting the project completion time.
⚫ Floats are of following types:
1. Total float: The time span by which starting or finishing of an activity can be delayed
without delaying the completion of the project.
It is the maximum available time in excess of the activity completion time.
Total float is given by FT
FT = (TLj – TEi) – tij
Total float is given by FT
FT = (TLj ) – (TEj – tij)
FT = (TLj ) – (TEj – tij)
FT = LFT – EFT
FT = (TLj – tij) – TEi
FT = LST – EST
• Total float of an activity affects total float of succeeding as well as preceding activities.
2. Free float (FF): The delay which can be made without delaying succeeding activities. It
affects only preceding activities. It is denoted by F F. It is assumed that all activities start
as early as possible.
Free float is given by
⇒ F F = FT – S j
where Sj is head event slack.
17
www.gradeup.co
In free float, preceding activity is not allowed to occur at its latest time and hence total
float of preceding activity is affected. However the succeeding activity can start at its
earliest start time and hence its total float is not affected.
3. Independent float (FID): It is the minimum excess available time which exists without
affecting any of succeeding or preceding activities. It is denoted by F ID.
⚫ It is the excess of minimum available time over the activity duration.
FID = FF – Si
Where Si is tail event slack.
4. interfering float (FINT): It is similar to head event slack.
FINT = Sj = FT – FF
4.4. Critical Path
In CPM analysis, the path along which total floats are zero or minimum is called as critical
path. All activities on this path are critical. There can be more than one critical paths.
4.4.1. Subcritical Path: It is the path joining all subcritical activities. For a subcritical
activity total float is greater than zero i.e.,
FT > 0
4.4.2. Supercritical Path: It is the path joining all super critical activities. For a
supercritical activity total float is less than zero i.e.,
FT < 0
Example: Compute the earliest expected time of completion of a project whose network
is shown below. The earliest expected time of each activity is shown on arrows (in Weeks).
Solution:
The network commences from event 1 and culminates at event 9.
Thus earliest expected time of completion of event (T E1) = 1
Earliest expected time for event
18
www.gradeup.co
TE4 11 weeks
Thus,
(Larger of weeks and 11 weeks)
Thus, TE1 0
TE2 5 weeks
TE3 3 weeks
TE2 t25
E 5 9 14 weeks
TE3 t36
E 3 7 10 weeks
TE5 t5E 8
14 16 30 weeks
Now, TE8 TE6 t6–8
E 10 4 14 weeks 30 weeks
TE3 t3–8
E 3 10 13 weeks
9 TE7 t7E 9
21 18 39 weeks
Now; TE 44 weeks
TE8 t8–9
E 30 14 44 weeks
19
www.gradeup.co
Solution:
The expected time of an activity is given by,
10 9 4 7 10 7 37.17 37.17
9 8 2 4 6 4 30.17 30.17
8 5 3 5 7 5 26.17 26.17
7 5 0 0 0 0 19 20.5
7 3 11 13 15 13 19 20.5
6 5 0 0 0 0 17.5 17.5
3 1 4 6 8 6 6 7.5
2 1 1 3 5 3 3 4.34
20
www.gradeup.co
21
www.gradeup.co
22
www.gradeup.co
⚫ To get the same work done in less time, we have to increase amount of labour,
equipment and time saving material that too extra charges which simply means increases
in direct cost.
⚫ The project has highest cost corresponding to the crash duration, and has normal cost
corresponding to the normal duration.
⚫ Normal time (tn): Normal time is the standard time that an estimator would usually
allow for an activity.
⚫ Crash Time (tc): Crash times is the minimum possible time in which activity can be
completed, by employing extra resources. Crash time is that time, beyond which the
activity cannot be shortened by any amount of increase in the resources.
⚫ Normal Cost (Cn): This is direct cost required to complete the activity in normal time
duration.
⚫ Crash Cost (Cc)): This is direct cost corresponding to the completion of the activity
within crash time.
****
23
www.gradeup.co
24