Project Planning, Design & Implementation β Project Planning and Scheduling, NEC licence examination syllabus (Nepal Engineering Council).
Resource Levelling and Smoothing
A schedule that assumes unlimited resources is arithmetic, not a plan.
π Where this lives: The reason this topic exists is visible on any construction site with a hiring-and-firing pattern: a crew brought on for a three-week peak, paid off, then re-hired a month later. Every one of those cycles costs recruitment time, induction, a learning curve, and often the loss of the best workers to a competitor who offered continuity. A schedule with a smooth resource profile is worth real money for reasons that never appear in the network diagram. Search "resource levelling construction labour histogram smoothing".
The problem, and the two techniques
THE CRITICAL PATH METHOD OF THE PREVIOUS TOPIC MAKES AN
ASSUMPTION IT NEVER STATES:
THAT WHATEVER RESOURCES AN ACTIVITY NEEDS ARE AVAILABLE WHEN
IT WANTS TO START.
That is false in every real project. Scheduling every activity
at its early start typically produces a resource profile with
sharp peaks and deep troughs β demanding twenty carpenters in
week 3 and four in week 7 β which is both unachievable and, if
achieved, wasteful.
THE RESOURCE HISTOGRAM makes the problem visible: plot, for each
day, the total resource required by all activities in progress.
WORKED, using the network from the scheduling topic with a
labour requirement added to each activity:
ACT ES EF DUR LABOUR TOTAL FLOAT
ββββββββββββββββββββββββββββββββββββββββ
A 0 4 4 6 0
B 0 6 6 4 1
C 4 7 3 8 0
D 4 9 5 5 5
E 7 14 7 6 0
F 14 18 4 7 0
G 18 20 2 3 0
ββββββββββββββββββββββββββββββββββββββββ
AT EARLY START, the daily requirement is:
days 1β4 : 10 (A 6 + B 4)
days 5β6 : 17 (B 4 + C 8 + D 5) β PEAK
day 7 : 13 (C 8 + D 5)
days 8β9 : 11 (D 5 + E 6)
days 10β14: 6 (E)
days 15β18: 7 (F)
days 19β20: 3 (G)
PEAK = 17, TOTAL = 173 person-days,
AVERAGE = 173/20 = 8.65
THE PEAK IS NEARLY TWICE THE AVERAGE β the classic signature
of an unlevelled schedule. Hiring for the peak means paying
for idle capacity most of the time.
ββ THE TWO TECHNIQUES, AND THE DIFFERENCE BETWEEN THEM βββββ
RESOURCE SMOOTHING (also called TIME-CONSTRAINED scheduling)
THE PROJECT DURATION IS FIXED AND MUST NOT CHANGE.
Activities are shifted WITHIN THEIR FLOAT ONLY, to even out
the profile.
THE CRITICAL PATH IS UNTOUCHED, because critical activities
have no float to move within.
OUTCOME: a smoother histogram, SAME END DATE, and the peak
reduced only as far as the available float permits.
RESOURCE LEVELLING (also called RESOURCE-CONSTRAINED
scheduling)
A RESOURCE LIMIT IS FIXED AND MUST NOT BE EXCEEDED.
Activities are delayed as far as necessary to respect the
limit β INCLUDING BEYOND THEIR FLOAT, AND INCLUDING
CRITICAL ACTIVITIES.
OUTCOME: the limit is respected, and THE PROJECT DURATION
USUALLY INCREASES.
THE DISTINCTION IN ONE LINE, and this is the examinable point:
SMOOTHING PROTECTS THE DATE AND ACCEPTS AN IMPERFECT
RESOURCE PROFILE.
LEVELLING PROTECTS THE RESOURCE LIMIT AND ACCEPTS A LATER
DATE.
They answer different questions, and which applies depends
on which constraint is genuinely binding. If the deadline is
contractual with liquidated damages, smooth. If there are
only twelve carpenters in the district, level.
ββ SMOOTHING THE WORKED EXAMPLE ββββββββββββββββββββββββββββ
Activity D has 5 days of total float. Delaying it from
ES = 4 to start at day 9 (its latest start) gives:
days 1β4 : 10 (A 6 + B 4)
days 5β6 : 12 (B 4 + C 8) β new peak
day 7 : 8 (C 8)
days 8β9 : 6 (E 6)
days 10β14: 11 (E 6 + D 5)
days 15β18: 7 (F)
days 19β20: 3 (G)
PEAK FALLS FROM 17 TO 12 β a 29% reduction β WITH THE SAME
173 PERSON-DAYS OF WORK AND THE SAME 20-DAY DURATION.
THAT IS THE WHOLE ARGUMENT FOR THE TECHNIQUE: THE PEAK
DEMAND FELL BY NEARLY A THIRD AT NO COST IN TIME OR
LABOUR β purely by starting one non-critical activity later
than it strictly had to.
NOTE ALSO WHAT DID NOT CHANGE: the total area under the
histogram is fixed by the work itself. LEVELLING AND
SMOOTHING REDISTRIBUTE DEMAND; THEY NEVER REDUCE IT.
Method, and the wider consequences
THE LEVELLING PROCEDURE, as done by hand:
1. Build the network, compute floats, and draw the resource
histogram at EARLY START.
2. Identify the periods exceeding the limit (or the peaks to
be reduced).
3. Among activities in those periods, DELAY THE ONE WITH THE
GREATEST TOTAL FLOAT FIRST β it costs least in schedule
risk.
4. Recompute the histogram and repeat.
5. If the limit still cannot be met using float alone, delay
critical activities and accept the extension.
THE COMMON PRIORITY (HEURISTIC) RULES when several activities
compete for a scarce resource:
Β· LEAST TOTAL FLOAT FIRST β protects the end date
Β· SHORTEST DURATION FIRST β clears the queue quickly
Β· GREATEST RESOURCE DEMAND FIRST
Β· EARLIEST LATE START FIRST β the most widely used
THESE ARE HEURISTICS, NOT OPTIMISATION. Exact resource-
constrained scheduling is NP-HARD, so software uses
heuristics too, and DIFFERENT RULES GIVE DIFFERENT
SCHEDULES β none of them provably best. An exam answer
should say so, because it is the honest statement of the
method's status.
ββ WHY A SMOOTH PROFILE IS WORTH MONEY βββββββββββββββββββββ
Β· HIRING AND FIRING COSTS: recruitment, induction, severance,
and the learning curve repaid each time a new crew arrives.
Β· RETENTION: skilled workers who are laid off go elsewhere,
and the best of them do not come back.
Β· PLANT AND EQUIPMENT: a peak fixes the fleet size, and
equipment is paid for whether it works or not.
Β· ACCOMMODATION, transport, canteen, supervision and site
facilities are all sized for the peak.
Β· SUPERVISION QUALITY falls when a crew doubles suddenly, and
accident rates rise with unfamiliar labour.
Β· LEARNING CURVE: a stable crew becomes faster at repeated
work; a churning crew never does.
ββ RESOURCE AGGREGATION AND ALLOCATION, the related terms ββ
AGGREGATION β simply totalling the requirement over time,
which is the histogram itself.
ALLOCATION β assigning specific resources to specific
activities.
LEVELLING / SMOOTHING β adjusting timing, as above.
ββ THE RESOURCE-CONSTRAINED CRITICAL PATH ββββββββββββββββββ
A subtlety worth knowing, because it surprises people:
ONCE RESOURCES ARE CONSTRAINED, THE LONGEST PATH IS NO
LONGER NECESSARILY THE BINDING ONE.
Two activities may be forced into sequence not by any logical
dependency but because they need the same crane. That creates
a RESOURCE DEPENDENCY, and the chain of activities linked by
logic AND resources is the CRITICAL CHAIN β the concept behind
Goldratt's critical chain project management. Under resource
constraints, delaying a "non-critical" activity CAN delay the
project, which the classical critical path would deny.
ββ MULTI-PROJECT RESOURCE MANAGEMENT βββββββββββββββββββββββ
In a firm running several projects from one pool of engineers
and equipment, levelling happens ACROSS projects, and the
conflicts are political as well as technical. THE COMMON
FAILURE IS TAKING ON TOO MANY CONCURRENT PROJECTS: everything
then runs slowly because everyone is multitasking, and
multitasking across projects adds set-up time to every switch
while delivering nothing sooner.
THE COUNTERINTUITIVE REMEDY IS TO START FEWER PROJECTS AT
ONCE β finishing them sequentially delivers the first ones
earlier and the last no later.
The distinction in one line: smoothing protects the date and accepts an imperfect resource profile; levelling protects the resource limit and accepts a later date. Which applies depends on which constraint actually binds β a contractual deadline with liquidated damages calls for smoothing, twelve carpenters in the district calls for levelling.
π Go further: The resource-constrained scheduling problem is genuinely NP-hard, which is why no software solves it exactly and every tool ships heuristics instead. Change the priority rule from "least float first" to "earliest late start first" and the same project produces a different schedule, sometimes days apart in completion β neither provably better. This is worth knowing when a planning package prints a confident resource-levelled end date: that date is the output of a heuristic on a problem with no tractable optimum, not a calculation like the critical path. Search "resource constrained project scheduling problem NP-hard heuristics".
π‘ Exam angle: the near-certain question is the distinction between levelling and smoothing β give it as time-constrained versus resource-constrained and state exactly what each protects and what each sacrifices. Be able to build a resource histogram from a network with resource loadings, identify the peak, and show a smoothed version obtained by shifting a non-critical activity within its float, quoting the before-and-after peak. Note that the total area is unchanged. Give the levelling procedure and the heuristic priority rules, saying that they are heuristics because the exact problem is NP-hard. Mention the resource-constrained critical path / critical chain for the higher marks.
Syllabus points
Resource levelling vs smoothing
Create a free account to tick topics off, take notes as you read, watch the video lessons and get a day-by-day study plan built around your exam date.