Sunteți pe pagina 1din 16

Resource Leveling

Resource Leveling
Rescheduling Resources – the
Leveling technique
• What is leveling?
– Distributing resources equitably across the
project
• Why level?
– Eliminate extraordinary demand for resources
– Improve Resource Productivity and Efficiency
– Predict material and equipment requirements
better
– Reduce cash shortages
Resource Leveling Caveats
• Solutions are not optimizations – they are
heuristic based
• Resource Leveling involves a lot of time
and effort
• Improvement in resource allocation is not
predictable
The Resource Histogram
10

7
6

Days
1 2 3 4 5
Minimum Moment Theorem
Given an area and an interval, the moment of the histogram around
the X-axis will be minimum when the histogram is a rectangle
10
8

7 7 7 7 7 7
6

4
H1 H2
Days

1 2 3 4 5 2 2 2 2 2

M(H1) > M(H2)


Improvement Factor - IF
• Consider Activity A of duration T, requiring
r resources per day.
• Let it be shifted by a duration S
• xi is the resource sum on day i for all days
where resource sums are deducted
• wi is the resource sum on day i for all days
where resource sums are added
• IF(A,S) = r(∑ xi - ∑ wi - mr), for i=1 to m
– m = minimum of S or T
Example
Activity A Activity A
4 res/day 4 res/day

Day 1 2 3 4 5
Original 10 10 10 2 2
Resource
Sums
Shift -4 -4 0 4 4
Final 6 6 10 6 6
Resource
Sums

IF (A,3) = 4[(10+10) - (2+2) - 2x4] = 32


Minimum Moment Algorithm:
• Compute the network.
• Schedule all activities at their early start.
• Assign sequence steps or other suitable group identifier
to each activity.
• Group the activities accordingly (traditionally by early or
late sequence step).
• Compute the free float of each activity (at this point no
activity has backward free
float, only forward free float).
 Calculate the daily resource histogram that corresponds
to the early schedule.
Forward Pass 1,2
Starting with the last group of activities, the
following steps are performed:

• 1. Shift all activities J for which the daily


resource requirement rJ = 0 by the amount of
their Forward Free Float FFJ .

• 2. Remove all activities with no Forward Free


Float from the group. If no activities remain in
the group go to step 6.
Forward Pass – 3
• 3. For the other activities J in the group:
• 3.1. Compute the improvement factor IF(J,Sj ) for all
possible forward shifts Sj , Sj=1,2,...,FFj .
• 3.2. Select the shift that produces the greatest
improvement factor.
• 3.3. If more than one shift produces the maximum
improvement factor, select the largest shift.
• 3.4. Call this shift SJ* and the corresponding maximum
improvement factor IFJ*= IF(J,SJ*).
Forward Pass –4
• 4. From within these activities:
• 4.1. Select the one with the greatest IFJ* .
• 4.2. If there is a tie, select the one with largest rJ
• 4.3. If still tied, select the one with the largest SJ*
.
• 4.4. If still tied, select the one with the latest
ESDJ .
Forward Pass –5
• 5. If the IFJ* for the selected activity J is
negative go to step 6, otherwise:
• 5.1. Carry out the shift.
• 5.2. Update the forward and backward free
float for all activities.
• 5.3. Update the resource histogram.
• 5.4. Go back to step 2.
Forward Pass-6
• 6. Consider the group of activities in the
earlier group and then go back to step 1
until all the groups have been considered.
Backward Pass
• The second part of the algorithm is called the backward
pass. It is similar to the forward pass except that this
time we consider the groups in reverse order.
Furthermore, activities are now shifted backward to
earlier times rather than forward to later times. Although
most of the leveling is done in the forward pass, the
backward pass is necessary. It restores free float to the
activities and it may also reduce the moment of the daily
resource histogram further.
Thank You

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