Scribd
Upload
147 views

Resource Allocation & Levelling: Prof. Liaqat Ali Qureshi Uet Taxila

The document discusses resource allocation and leveling for project management. It defines resources as the means to complete project activities like people, machinery, materials, etc. Resource allocation assigns resources to activities without exceeding availability, while leveling smoothens demand over time for productivity. Leveling techniques like sum of squares and Burgess method are described. Limited resource constraints require rescheduling activities in a serial manner to satisfy restrictions. An example project is provided and rescheduled to satisfy resource L and M limitations.

Uploaded by

sajid khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
147 views

Resource Allocation & Levelling: Prof. Liaqat Ali Qureshi Uet Taxila

The document discusses resource allocation and leveling for project management. It defines resources as the means to complete project activities like people, machinery, materials, etc. Resource allocation assigns resources to activities without exceeding availability, while leveling smoothens demand over time for productivity. Leveling techniques like sum of squares and Burgess method are described. Limited resource constraints require rescheduling activities in a serial manner to satisfy restrictions. An example project is provided and rescheduled to satisfy resource L and M limitations.

Uploaded by

sajid khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 31

RESOURCE ALLOCATION &

LEVELLING

By

PROF. LIAQAT ALI QURESHI


UET TAXILA
RESOURCES

 Means to complete project activities are


called RESOURCES.
 Examples are People, Machinery, Material,
Capital, Time, etc.
 Peak demands of resources over short
periods is undesirable.
 Resources may be limited or unlimited in
nature from project to project
Resource Utilization Factor

 The degree to which a resource may be used


is measured in terms of a Resource Utilization
Factor.
 Mathematically,
Usable Resources x Days Used x 100
R.U.F. (%) =
Usable Resources x Days available
Resource Profile

 Plot of daily Resource requirements versus


time is called

 Resource Profile
 Resource-use Graph
 Histogram
Resource Allocation

To assign required resources to work


activities such that available resources are
not exceeded.
Resource Leveling

 Smoothening of a resource demand is called


Resource leveling.
 Resource leveling is an attempt to assign
resources to project activities in a manner
that will improve productivity and efficiency.
Ideal Condition
Early-start and Late-start Histograms
Ideal Level Histogram
Practical & Target Histogram
Objects of Resource Leveling

 Fixed Crew Size


 Learning Curve
 Start-up Problems
 Completion Congestion
Techniques for Resource Leveling

 Sum of Resources Square method


 Burgess Leveling Procedure
 Wiest Leveling Procedure
Limited Resource Allocation

 Where resources e.g., plant, labour,


materials (or capitals) are restricted, the
activities have to be rescheduled to satisfy
this form of constraint.
 This will imply scheduling those activities that
use such resources, in a sequential or serial
fashion. And this might create the situation
where activities overrun their allowable float.
Limited Resource Allocation

 If resource limitations are known at the


outset, for example, only one site crane is
available, then the original network plan for
the project can include this constraint.
 In certain cases, it may be possible to hire
additional plant to cover peak requirements;
in this case no rescheduling of the activities
is called for
Algorithm

1- Calculate initial early start (ES) and late start (LS) time
for each activity in the project, and set time now equal
to1, i.e., T = 1
2- Determine the initial eligible activity set (EAS), i.e., those
activities with all predecessor activities scheduled.
3- From among the members of the current EAS,
determine the ordered scheduling set (OSS) of activities
i.e., activities with ES < T, ordered according to LS with
smallest values first and within this characteristic,
according to least activity duration first.
Algorithm

4- Consider the activities in OSS in the order listed and schedule


those activities for which sufficient resources are available for
the duration of the activity. As activities are scheduled, update
the level of resources available, and update the members of
EAS.
5- Have all activities been scheduled, i.e., is EAS empty set ?

If Yes STOP

If No Set T new = T old + 1, and

compute new ES times for the updated EAS.


6- Go to step 3 and continue.
EXAMPLE

Reschedule the Project given in Figure


keeping in view the limitation of Resources L
to be 8 per day and M to be 6 per day.
ACT
D
3 7 H EST EFT
7 8
A 8 12 LST LFT
1 3 12 13
5 0 TF FF
6 8 5 4
E I K
5 0 3 8 8 12
12 15
B
1 3 4 9 9 13
13 16
1 3 1 0 1 0
1 0

0 0
F
3 11
C
3 11
1 2
J
0 0 11 16
7 8

6 0 11 16

G 0 0
2 5

8 11

6 6
Resources
Act Time
Required

L
L M D ES F 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
S

3L 3L
A 3 __ 2 1 5 6 X X

x x x x
D __ 2 4 3 5 8 2M 2M 2M 2M

6L 6L
B* 6 __ 2 1 0 1 X X

x x x x x
E __ 2 5 3 1 4 2M 2M 2M 2M 2M

4L
H 4 __ 1 7 5 12 X

2L 2L 2L 2L
I 2 __ 4 8 1 9 X X X X

3L
C 3 __ 1 1 6 7 X

4L 4L 4L 4L 4L 4L 4L 4L
F* 4 4 8 3 0 3 4M 4M 4M 4M 4M 4M 4M 4M

5L 5L 5L
G 5 __ 3 2 6 8 X X X

x x x
K __ 5 3 12 1 13 5M 5M 5M

2L 2L 2L 2L 2L
J* 2 __ 5 11 0 11 X X X X X
Let T = 1

EAS : A B C (E F)
ES : 1 1 1
LS : 6 1 7
OSS : B A C

 Schedule B to days 1-2


 Remove B from EAS
 Add F to EAS
Let T = 2

EAS : A C E F
ES : 2 2 3 3
LS : 6 7 4 3
OSS : A C

 No Activity can be scheduled on T = 2


Let T = 3
EAS : A C E F (I D)
ES : 3 3 3 3
LS : 6 7 4 3
OSS : F E A C

 Schedule F to days 3-10


 Remove F from EAS
 Schedule E to days 3-7
 Remove E from EAS.
 Schedule A to days 3-4
 Remove A from EAS EAS
 Add I & D to EAS
Let T = 4

EAS : C I D
ES : 4 8 5
LS : 7 9 8
OSS : C

 No Activity can be scheduled on T = 4


Let T = 5

EAS : C I D (G)
ES : 5 8 5
LS : 7 9 8
OSS : C D

 Schedule C to day 5
 Remove C from EAS
 Add G to EAS
Let T = 6

EAS : I D G
ES : 8 6 6
LS : 9 8 8
OSS : G D

 No Activity can be scheduled on T = 6

Note: G and D have same LS. These are


ordered on less duration first.
Let T = 7

EAS : I D G
ES : 8 7 7
LS : 9 8 8
OSS : G D

 No Activity can be scheduled on T = 7


8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8

2 2 4 4 4 4 4 4 4 4 6 3 3 6 6 6 6 6
LEVEL OF RESOURCE L
UNASSIGNED
1 1 1 2 2 2 1 2

6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6

2 2 2 2 2 2 2 2 4 1 1 1
LEVEL OF RESOURCE M
UNASSIGNED

0 0 0 0 0 0 0 0
8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8

2 2 4 4 4 4 4 4 4 4 6 3 3 6 6 6 6 6
LEVEL OF RESOURCE L
UNASSIGNED
1 1 1 2 2 2 1 2

LEVEL OF RESOURCE L
ASSIGNED
6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6

2 2 2 2 2 2 2 2 4 1 1 1
LEVEL OF RESOURCE M
UNASSIGNED
0 0 0 0 0 0 0 0

LEVEL OF RESOURCE M
ASSIGNED
THANK YOU

You might also like