Chapter - 5 - Project Management and Resource Allocation
Chapter - 5 - Project Management and Resource Allocation
Project Management
and
Resource Allocation
What is a Project?
“Unique process consisting of a set of coordinated,
controlled and planned set of activities with start and
finish dates, undertaken conforming to achieve an objective
to specific requirements, including constraints of time, cost,
quality and resources”
•
• Level 2 Phase1 Phase2 Phase 3
•
• Level 3 Part 1 Part 2 Part1 Part 2 Part 1 Part 1,2,….n
•
Level 4 Subassembly 1 Subassembly 2
Project Responsibility
Functional Responsibility
Project A
Project B
Project C
Project D
Matrix Organization Structure
Network Diagram
• In network modeling of projects, the network
diagram is of primary importance.
Advantages of network/arrow diagrams:
• It clearly shows the inter-relationship between
events.
• The project is seen as integrated whole, thus
making it easier for control.
• It can be used even for highly complicated
projects consisting of a large number of
activities.
• It directly indicates the time required in between
two activities.
1) EVENT:
a)Merge event: When more than one activity come and
join an event, such an event is known as merge event.
b)Burst event: When more than one activity leave an
event, such an event is known as a burst event.
c)Merge and burst event: An activity may be a merge
and burst event at the same time as with respect to
some activities
C
B
A
2) ACTIVITY:
• Any individual operation, which utilizes
resources and has a beginning and an end, is
called an activity.
• An arrow represents an activity
“A” whose estimated duration is “k”
unit of time.
A
k
Classification of Activity:
• A) Predecessor activity: Activities that must be
completed immediately prior to the start of another
activity are called Predecessor activities.
• B) Successor activity: Activities that cannot be started
until one or more of other activities are completed,
but immediately succeed them are called successor
activities.
• C) Concurrent activities: Activities that cannot be
accomplished concurrently are known as concurrent
activities. It may be noted that an activity can be a
predecessor or successor to an event or it may be
concurrent with one or more of the other activities.
D) Dummy activity: An activity which does not
consume any kind of resource but merely depicts the
technological dependence is called a dummy activity.
• It may be noted that the dummy activity is inserted
in the network to clarify the activity pattern in the
following two ways:
• 1) To make the activities with common starting and
finishing points distinguishable,
• 2) Identify and maintain the proper precedence
relationship between activities that are not
connected with arrows.
• Ex: Consider a situation where A and B are
concurrent activities, C is dependent on A, and D is
dependent on A and B both.
Such a situation can be handled by using a
dummy activity as shown in fig.(a) below.
• Ex.2 Consider a case where B and C have the
same job reference and they can be started
independently on completion of A.
• But, D could be started only after the completion
of B and C. This relationship is shown by the
dummy line as shown in fig. (b).
5 A 6
C A B D
1 2 4 5
Dummy Dummy
B activity C activity
D 3
(a) 7 (b)
Rules for drawing network diagram:
1. Each activity is represented by one and only one
arrow in the network:
2. No two activities can be identified by the same
events:
• Ex: Activities a and b in fig. (a) have the same end
events.
Modified representations after introducing a
dummy activity d is shown in fig. (b).
As a result of using the dummy, activities a and b
can now be identified by unique end events.
• It must be noted that a dummy activity does
naot consume any time or resource.
2
a
a d (Dummy) d
b
1 3 b
b
a a 3
1 3 1
d b b d
2
2
3) Check the precedence relationship:
1. What activity must be completed immediately
before this activity can start?
2. What activity must follow this activity?
3. What activities must occur simultaneously with
this activity?
Important suggestions for
drawing good networks:
• Try to avoid arrows which cross each other.
• Use straight arrows.
• Do not attempt to represent duration of activity by
arrow length.
• Use arrows from left to right ( or right to left). Avoid
mixing two directions, vertical and standing arrows
may be used if necessary.
• Use dummies freely in rough draft but final network
should not have any redundant dummies.
• The network has only one entry point (start event)
and one point of emergence (ending event).
Common errors in drawing networks:
• 1) Dangling: To disconnect an activity before
the completion of all activities in a network
diagram is known as dangling. As shown in fig.
below, activities (b-c) and (d-e) are not the last
activities in the network. So the diagram is
wrong and indicates the error of dangling.
e
Dangling
a b d f h
c g
2) Looping or Cycling:
– Drawing an endless loop in a network is known as an
error of looping as shown in the following fig.
14
13
15 22
Looping
20 Looping 23
12
21
3) Redundancy:
1
1
1 12
0
Redundancy
Scheduling Systems
Critical Path Method (CPM)
Gantt Chart
CRITICAL PATH METHOD (CPM)
Deterministic model
No uncertainty is considered
preceding nodes
successor nodes
Activity Float=LS-ES=LF-EF
[Start-a-e-h-j-Finish]
Project evaluation and review technique (PERT)
Probabilistic model
Immediate
Task Predecesors Optimistic Most Likely Pessimistic
A None 3 6 15
B None 2 4 14
C A 6 12 30
D A 2 5 8
E C 5 11 17
F D 3 6 15
G B 3 9 27
H E,F 1 4 7
I G,H 4 19 28
41
Project Crashing
Projects will sometimes have deadlines that are
impossible to meet using normal procedures
By using exceptional methods it may be possible to
finish the project in less time than normally required
3. Select the activity on the critical path with the smallest crash cost
per period and crash this activity to the maximum extent possible or
to the point at which your desired deadline has been reached
4. Check that the critical path you were crashing is still critical. If the
critical path is still the longest path through the network, return to
step 3. If not, find the new critical path and return to step 3 .
• To shorten a project, crash only activities that are critical.
Time
The time cost Trade-off
Step3: Prioritize the activities to be crashed. When
there are many activities which can be crashed, it is
necessary to know which activity will be crashed first?
This can be done by selecting the activity
a. with the least cost per day to crash.
b. that is easiest to crash.
c. which can be crashed soonest to bring the
project back on course.
Step4. Crash activities one day at a time, then re-
analyze the network to see if any other activities have
gone critical.
Note: Continue this iterative process until there are
no activities with negative float.
Example : - The owner wants you to finish the project in 120 days.
Find the minimum possible cost for the project if you want to finish it
on 120 days.
Activity Predecessor Duration
A -------- 120
B -------- 20
Draw the network by AOA
C B 40
D C 30
E D,F 50
F B 60
Solution
To crash activities, First draw the activity on arrow diagram
and find the critical path
SA= CC-NC
ND-CD
SB = $200/day
SC = $600/day
SD = $60/day
SE = $120/day
SF = $300/day
Cont…
• The normal cost for the project is the sum of a normal cost
for each activity.
• The normal cost for the project is $48300 and the normal
duration is 140 days.
• The activity which should be crashed is the one on the
critical path which will add the least amount to the overall
project cost.
• This will be the activity with the least-cost slope.
• The duration can be reduced as long as the critical path is
not changed or a new critical path is created.
• In addition, the activity duration cannot be less than the
crash duration.
Cont…
SD = $60/day (least-cost slope) Maximum of 10 days can
be cut from this schedule by reducing the duration of
activity D to the crash duration of 20 days.
Overall duration is 130 days and there are multiple critical paths (B-F-
E and B-C-D-E). Total project cost at this duration is the normal cost
of $48300 plus the cost of crashing the activity D by 10 days (60 * 10
= $600) for a total of $48900.
Quiz
Example : - The owner wants you to finish the project in 120 days.
Find the minimum possible cost for the project if you want to finish it
on 120 days.
Normal
Time
Crash Normal
Crash
Time
Crash Normal
• When the direct costs and indirect costs are
combined on the same graph, an optimum
position is derived. (Below fig.)
Cost Combined Direct and Indirect Costs
O
p
t
i
m
u Indirect
m
Direct
Time
Cost
Crash All
C
Crash No- Critical
D
Crash
B
Critical Only
A Normal Time
Normal Cost
Time
Time Cost Trade -off
• The correct action would be to crash all the critical activities.
The project moves to point B. Crashing the critical activities
has reduced the duration of the project with a small increase
in costs.
Crashing the critical activities has reduced the
duration of the project with a small increase in
costs.
• The fourth point on the graph, C, indicates the
position when all the activities are crashed. Again
this is not recommended because there has been
no time improvement on point B, yet the costs
have increased tremendously.
• The total cost of the project can be calculated by:
• Ctotal = CN + m dcp where CN = total sum of
total total