Project Planning, Scheduling and Control

Resource Allocation
&
Resource Leveling

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


RESOURCE ALLOCATION
RESOURCE • Maximum resource available
per time unit is defined.
• Total resource required per time unit
should not exceed
the maximum availability.
PROJECT • Project duration can be extended
DURATION if necessary.
necessar
METHOD • For activities with ‘conflicting’ resource,
rearrange the sequence as follows:
i = activity with ‘min EF’
j = activity with ‘max LS’
Sequence: i – j
(activity i followed by activity j)
Tarumanagara University, Graduate Program in Civil Engineering
Project Planning, Scheduling and Control
RESOURCE LEVELING
• Maximum resource available
per time unit is not defined.
• Project duration is fixed
(sho ld not be e
(should extended).
tended)
• Maintain the activity dependencies.
• Level the resource,
only within available Free Float.
• Check the ‘improvement’ by
the minimum sum-of-the-square principle:
Min Σ(R2)
R=total resource required per time unit.
• Use the Minimum Moment Algorithm.
Onnyxiforus G.
 Project Planning, Scheduling and Control

RESOURCE ALLOCATION
Initial Condition (First Iteration)
A D
2
P 1 1 1 1 2 2
Act. Succ. Dur. ES EF LS LF TF FF Res. req'd F 1 1 1 1 0 0
(days) Plumb. Fitters
(P) (F) B
A D 4 0 4 4 8 4 0 1 1 P 1 1
B G 2 0 2 8 10 8 8 1 0 F 0 0
C E, F 2 0 2 0 2 0 0 0 3
D G 2 4 6 8 10 4 4 2 0 C E G
1 3 4 5
E G 8 2 10 2 10 0 0 1 0 P 0 0 1 1 1 1 1 1 1 1 1 1 1 1
F - 4 2 6 10 14 8 8 3 0 F 3 3 0 0 0 0 0 0 0 0 2 2 2 2
G - 4 10 14 10 14 0 0 1 2
F
Next Iteration: C followed by A P 3 3 3 3
F 0 0 0 0
D 4
2
2 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B G
4 2 E 4
8 Resource Loading
6 Histogram
C F 5
1 Max Available P
3 5
2 4
4 Max Available F
3
2
1
g
Resource Loading:
(Max Available = 4) P 2 2 5 5 6 6 1 1 1 1 1 1 1 1
(Max Available = 3) F 4 4 1 1 0 0 0 0 0 0 2 2 2 2

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE ALLOCATION
Second Iteration
B
P 1 1
Act. Succ. Dur. ES EF LS LF TF FF Res. req'd F 0 0
(days) Plumb. Fitters
(P) (F) A D
3
A D 4 2 6 4 8 2 0 1 1 P 1 1 1 1 2 2
B G 2 0 2 8 10 8 8 1 0 F 1 1 1 1 0 0
C A, E, F 2 0 2 0 2 0 0 0 3
D G 2 6 8 8 10 2 2 2 0 C E G
1 2 4 5
E G 8 2 10 2 10 0 0 1 0 P 0 0 1 1 1 1 1 1 1 1 1 1 1 1
F - 4 2 6 10 14 8 8 3 0 F 3 3 0 0 0 0 0 0 0 0 2 2 2 2
G - 4 10 14 10 14 0 0 1 2
F
Next Iteration: A followed by F P 3 3 3 3
B 4 F 0 0 0 0
1
2
C 2 E 1 2 3 4 5 6 7 8 9 10 11 12 13 14
8 G
D 4
2 2
Resource Loading
6 Histogram
A 4 F
5 Max Available P
4
3 5
4 Max Available F
3
2
1
Resource Loading:
(Max Available = 4) P 1 1 5 5 5 5 3 3 1 1 1 1 1 1
(Max Available = 3) F 4 4 1 1 1 1 0 0 0 0 2 2 2 2

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE ALLOCATION
Third Iteration
B
P 1 1
Act. Succ. Dur. ES EF LS LF TF FF Res. req'd F 0 0
(days) Plumb. Fitters
(P) (F) A D
3
A D, F 4 2 6 4 8 2 2 1 1 P 1 1 1 1 2 2
B G 2 0 2 8 10 8 8 1 0 F 1 1 1 1 0 0
C A, E, F 2 0 2 0 2 0 0 0 3
D G 2 6 8 8 10 2 2 2 0 C E G
1 2 4 5
E G 8 2 10 2 10 0 0 1 0 P 0 0 1 1 1 1 1 1 1 1 1 1 1 1
F - 4 6 10 10 14 4 4 3 0 F 3 3 0 0 0 0 0 0 0 0 2 2 2 2
G - 4 10 14 10 14 0 0 1 2
F
Next Iteration: D followed by F P 3 3 3 3
B 4 F 0 0 0 0
1 2
C 2 E 1 2 3 4 5 6 7 8 9 10 11 12 13 14
8 G
D 4
2 2 Resource Loading
A 4 6 Histogram
5 Max Available P
F
3 5 4 Max Available F
4
3
2
1
Resource Loading:
(Max Available = 4) P 1 1 2 2 2 2 6 6 4 4 1 1 1 1
(Max Available = 3) F 3 3 1 1 1 1 0 0 0 0 2 2 2 2

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE ALLOCATION
Final Iteration
B
P 1 1
Act. Succ. Dur. ES EF LS LF TF FF Res. req'd F 0 0
(days) Plumb. Fitters
(P) (F) A D
3
A D, F 4 2 6 4 8 2 0 1 1 P 1 1 1 1 2 2
B G 2 0 2 8 10 8 8 1 0 F 1 1 1 1 0 0
C A, E, F 2 0 2 0 2 0 0 0 3
D G F
G, 2 6 8 8 10 2 2 2 0 C E G
1 2 5 6
E G 8 2 10 2 10 0 0 1 0 P 0 0 1 1 1 1 1 1 1 1 1 1 1 1
F - 4 8 12 10 14 2 2 3 0 F 3 3 0 0 0 0 0 0 0 0 2 2 2 2
G - 4 10 14 10 14 0 0 1 2
F
4
P 3 3 3 3
B F 0 0 0 0
1 5
2
C 2 E 1 2 3 4 5 6 7 8 9 10 11 12 13 14
8 G
4
2 D' 0
Resource Loading
A 4
6 Histogram
5 Max Available P
D F
3 4 6 4 Max Available F
2 4
3
2
1
Resource Loading:
(Max Available = 4) P 1 1 2 2 2 2 3 3 4 4 4 4 1 1
(Max Available = 3) F 3 3 1 1 1 1 0 0 0 0 2 2 2 2

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

Minimum Moment Algorithm

for RESOURCE LEVELING

Setup
• Draw the Precedence Diagram g Network and
determine the sequence step number for each activity.
• Analyze the network and draw the Bar-chart
- Early schedule ( ES, EF )
- Critical activities
- Free Float ( FF ).
• Select a resource to be leveled and determine
th resource requirement
the i t per titime unit
it for
f each
h activity
ti it ( r ).
)
• Calculate the resource sum for each time unit.

Procedure
P d
1. Forward cycle
2. Backward cycle

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

FORWARD Begins with the activities on the last sequence step.

CYCLE 1. Examine the activities on the sequence step.
a. Activities with zero free float is passed over.
b. Activities having a zero resource rate is shifted to the limit of its Free Float.
c. Calculate the Improvement Factor ( IF ) of each activity for each possible shifting.
2 S
2. Select
l t ththe activity
ti it having
h i the th largest
l t Improvement
I t Factor.
F t
a. If the IF is negative, no shifting takes place. Go to the next sequence step.
b. If there is a tie in the largest IF for several activities, use this criteria in a sequential order:
i. The activity with the greatest resource rate ( r ) value.
ii. The activityy which creates the g greatest FF for its preceding g activities.
iii. The activity with the latest Early Start ( ES ) date.
iv. The first activity in the queue.

3. Shift the selected activity subject to:

a. If the largest
g IF is zero or p
positive, shift accordingly.
gy
b. If there is a tie in the largest IF for several possible positions of an activity,
shift the activity the greatest number of time units.

4. Update the Bar-chart: re-determine the Free Float for each activity.
Re-calculate the resource sum for each time unit.
5. Re-examine the activities on the sequence step.
Repeat step 1 to 4 until all shifting is complete on this step.
6. Examine the next earlier sequence step and repeat step 1 to 5.

7. Repeat step 1 to 6 until no further shifting takes place.

BACKWARD Begins with the activities on the first sequence step.

CYCLE Repeat step 1 to 7, using back float and progressing to the next later sequence step.

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

Back Float:

The time span in which

an activity can be started and not cause
the preceding activities to be finished earlier than their early finish dates.

or:

The difference between

the early start ( ES ) date of an activity
and the latest of the early finish ( EF ) dates of all the preceding activities.

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE LEVELING

Minimum Moment Algorithm

m m
IFA, n = r (  xi -  wi - mr )
1 1

IFA,n = Improvement Factor

for shifting activity A, n days out in time
r = daily resource rate for the activity
m = the minimum value, between:
number of days that the activity is shifted, and
the duration of the activity
XI = daily resource sum for the current time frame
over which
hi h resource will
ill b
be d
deducted
d t d
wI = daily resource sum for the time frame
over which resource will be added

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

Minimum Moment Algorithm

m m
IFA, n = r (  xi -  wi - mr )
1 1

 An activity can be shifted, up to the number of days of FF.

 As long as a non-zero positive number is obtained for the IF,

the resource histogram is improving.

 The “sequence step” is the order -

in which a dependent chain of activities is started.
started

 The process begins by sorting and evaluating -

the activities in the highest-numbered sequence step.

 The process completed when all IF are negative.

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE LEVELING
Stage 0 (Initial condition)
A E
2
R: 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2
Act. Succ. Dur. ES EF LS LF TF FF Daily Seq.
D1
(days) Res. Step D B
1 3 5
Rate R: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
A E 6 0 6 4 10 4 4 3 1 D2
B D, E, F 10 0 10 0 10 0 0 2 1 C 4
F
C F 5 0 5 11 16 11 5 8 1 R: 8 8 8 8 8 2 2 2 2 2 2
D - 7 10 17 15 22 5 5 2 2
E - 12 10 22 10 22 0 0 2 2 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
F - 6 10 16 16 22 6 6 2 2

2 13
12
A E
6 12 11
D1
10
B D
1 3 5 9
10 7
D2 8
C F 7
5 6
6
4 5
4
Step 1 Step 2 3
2
A E 1

Sta B D R: 13 13 13 13 13 5 2 2 2 2 6 6 6 6 6 6 4 2 2 2 2 2
End
169
169
169
169
169
25
4
4
4
4
36
36
36
36
36
36
16
4
4
4
4
4
R2:
C F Σ R: 128
2
Σ (R ): 1138

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE LEVELING 2

Forward Cycle 1
1, Stage 1 A E
6 D1 12
Step 1 Step 2
A E B D 5
2 1 3
10 7
R: 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 A E
C D2 F
D1
D B 5 6
1 3 5 Sta B D End
R: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 4
D2
C F C F
4
R: 8 8 8 8 8 2 2 2 2 2 2
Minimum Moment Algorithm
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
m m
IFA, n = r (  xi -  wi - mr )
13 1 1
12
11 Stage Step Act. IF r Σ xi Σ wi m IF Action for
10 nextt stage
t
9 F1-1 2 D IFD,1 2 6 2 1 4
8 IFD,2 2 12 4 2 8
7 IFD,3 2 18 6 3 12
6 IFD,4 2 24 8 4 16
5 IFD,5 2 30 10 5 20
4
3 2 F IFF,1 2 6 4 1 0
2 IFF,2 2 12 6 2 4
1 IFF,3 2 18 8 3 8
IFF,4 2 24 10 4 12
R: 13 13 13 13 13 5 2 2 2 2 6 6 6 6 6 6 4 2 2 2 2 2 IFF,5 2 30 12 5 16
169
169
169
169
169
25
4
4
4
4
36
36
36
36
36
36
16
4
4
4
4
4

R2: IFF,6 2 36 14 6 20 F, 6
Σ R: 128
2
Σ (R ): 1138

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE LEVELING 2

Forward Cycle 1
1, Stage 2 A E
6 D1 12
Step 1 Step 2
A E B D 5
2 1 3
R: 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 10 7 A E
C D2 F
D1
D B 5 6
1 3 5 Sta B D End
R: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 4
D2
C F C F
4
R: 8 8 8 8 8 2 2 2 2 2 2
Minimum Moment Algorithm
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
m m
IFA, n = r (  xi -  wi - mr )
13 1 1
12
11 Stage Step Act. IF r Σ xi Σ wi m IF Action for
10 next stage
9 F1-2 2 D IFD,1 2 4 4 1 -4
8 IFD,2 2 8 8 2 -8
7 IFD,3 2 12 12 3 -12
6 IFD,4 2 16 16 4 -16
5 IFD,5 2 20 20 5 -20
4
3
2
1

R: 13 13 13 13 13 5 2 2 2 2 4 4 4 4 4 4 6 4 4 4 4 4
169
169
169
169
169
25
4
4
4
4
16
16
16
16
16
16
36
16
16
16
16
16

R2:
Σ R: 128
2
Σ (R ): 1098

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE LEVELING 2

Forward Cycle 1
1, Stage 3 A E
6 D1 12
Step 1 Step 2
A E B D
2 1 3 5
R: 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 10 7 A E
D1 C D2 F
5 6
D B
1 3 5 Sta B D End
R: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 4
D2
C F C F
4
R: 8 8 8 8 8 2 2 2 2 2 2
Minimum Moment Algorithm
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
m m
IFA, n = r (  xi -  wi - mr )
13 1 1
12
11 Stage Step Act. IF r Σ xi Σ wi m IF Action for
10 nextt stage
t
9 F1-3 1 A IFA,1 3 13 2 1 24
8 IFA,2 3 26 4 2 48
7 IFA,3 3 39 6 3 72
6 IFA,4 3 52 8 4 96
5
4 1 C IFC,1 8 13 5 1 0
3 IFC,2 8 26 7 2 24
2 IFC,3 8 39 9 3 48
1 IFC,4 8 52 11 4 72
IFC,5 8 65 13 5 96
R: 13 13 13 13 13 5 2 2 2 2 4 4 4 4 4 4 6 4 4 4 4 4 IFC,6 8 65 12 5 104 C, 6
169
169
169
169
169
25
4
4
4
4
16
16
16
16
16
16
36
16
16
16
16
16

2
R: IFC,7 8 65 14 5 88
Σ R: 128 IFC,8 8 65 16 5 72
2
Σ (R ): 1098 IFC,9 8 65 18 5 56
IFC,10 8 65 20 5 40
IFC,11 8 65 20 5 40

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE LEVELING 2

Forward Cycle 1
1, Stage 4 A E
6 D1 12
Step 1 Step 2
A E B D
5
2 1 3
R: 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 10 7 A E
D1 C D2 F
DB 5 6
1 3 5 Sta B D E d
End
R: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 4
D2
C F C F
4
R: 8 8 8 8 8 2 2 2 2 2 2
Minimum Moment Algorithm
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
m m
IFA, n = r (  xi -  wi - mr )
13 1 1
12
11 Stage Step Act. IF r Σ xi Σ wi m IF Action for
10 next stage
9 F1-4 1 A IFA,1 3 5 10 1 -24
8 IFA,2 3 10 20 2 -48
7 IFA,3 3 15 30 3 -72
6 IFA,4 3 20 40 4 -96
5
4
3
2
1

R: 5 5 5 5 5 5 10 10 10 10 12 4 4 4 4 4 6 4 4 4 4 4
25
25
25
25
25
25
100
100
100
100
144
16
16
16
16
16
36
16
16
16
16
16

R2:
Σ R: 128
2
Σ (R ): 890

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE LEVELING 2

Forward Cycle 2
2, Stage 1 A E
6 D1 12
Step 1 Step 2
A E B D
2 1 3 5
10 7
R: 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 A E
C D2 F
D1
DB 5 6
1 3 5 Sta B D End
R: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 4
D2
C F C F
4
R: 8 8 8 8 8 2 2 2 2 2 2
Minimum Moment Algorithm
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
m m
IFA, n = r (  xi -  wi - mr )
13 1 1
12
11 Stage Step Act. IF r Σ xi Σ wi m IF Action for
10 next stage
9 F2-1 2 D IFD,1 2 12 4 1 12 D, 1
8 IFD,2 2 16 8 2 8
7 IFD,3 2 20 12 3 4
6 IFD,4 2 24 16 4 0
5 IFD,5 2 28 20 5 -4
4
3
2
1

R: 5 5 5 5 5 5 10 10 10 10 12 4 4 4 4 4 6 4 4 4 4 4
25
25
25
25
25
25

16
16
16
16
16
36
16
16
16
16
16
100
100
100
100
144

R2:
Σ R: 128
2
Σ (R ): 890

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE LEVELING 2

Forward Cycle 2
2, Stage 2 A E
6 D1 12
Step 1 Step 2
A E B D
2 1 3 5
R: 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 10 7 A E
C D2
D1 F
B D 5 6
1 3 5 Sta B D End
R: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 4
D2
C F C F
4
R: 8 8 8 8 8 2 2 2 2 2 2
Minimum Moment Algorithm
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
m m
IFA, n = r (  xi -  wi - mr )
13 1 1
12
11 Stage Step Act. IF r Σ xi Σ wi m IF Action for
10 nextt stage
t
9 F2-2 1 A IFA,1 3 5 10 1 -24
8 IFA,2 3 10 20 2 -48
7 IFA,3 3 15 30 3 -72
6 IFA,4 3 20 40 4 -96
5
4 1 C IFC,1 8 10 4 1 -16
3 IFC,2 8 20 8 2 -32
2 IFC,3 8 30 12 3 -48
1 IFC,4 8 40 16 4 -64
IFC,5 8 50 20 5 -80
80
R: 5 5 5 5 5 5 10 10 10 10 10 4 4 4 4 4 6 6 4 4 4 4
25
25
25
25
25
25
100
100
100
100
100
16
16
16
16
16
36
36
16
16
16
16

R2:
Σ R: 128
2
Σ (R ): 866

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE LEVELING 2

Forward Cycle 3,
3 Stage 1 A E
6 D1 12
Step 1 Step 2
A E B D
2 1 3 5
R: 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 10 7 A E
D1 C D2 F
B D 5 6
1 3 5 Sta B D End
R: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 4
D2
C F C F
4
R: 8 8 8 8 8 2 2 2 2 2 2
Minimum Moment Algorithm
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
m m
IFA, n = r (  xi -  wi - mr )
13 1 1
12
11 Stage Step Act. IF r Σ xi Σ wi m IF Action for
10 next stage
9 F3-1 2 D IFD,1 2 4 4 1 -4
8 IFD,2 2 8 8 2 -8
7 IFD,3 2 12 12 3 -12
6 IFD,4 2 16 16 4 -16
5
4
3
2
1

R: 5 5 5 5 5 5 10 10 10 10 10 4 4 4 4 4 6 6 4 4 4 4
25
25
25
25
25
25
100
100
100
100
100
16
16
16
16
16
36
36
16
16
16
16

R2:
Σ R: 128
2
Σ (R ): 866

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE LEVELING 2

Forward Cycle 3
3, Stage 2 A E
6 D1 12
Step 1 Step 2
A E B D
2 1 3 5
R: 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 10 7
A E
C D2 F
D1
B D 5 6
1 3 5 Sta B D End
R: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 4
D2
C F C F
4
R: 8 8 8 8 8 2 2 2 2 2 2
Minimum Moment Algorithm
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
m m
IFA, n = r (  xi -  wi - mr )
13 1 1
12
11 Stage Step Act. IF r Σ xi Σ wi m IF Action for
10 nextt stage
t
9 F3-2 1 A IFA,1 3 5 10 1 -24
8 IFA,2 3 10 20 2 -48
7 IFA,3 3 15 30 3 -72
6 IFA,4 3 20 40 4 -96
5
4 1 C IFC,1 8 10 4 1 -16
3 IFC,2 8 20 8 2 -32
2 IFC,3 8 30 12 3 -48
1 IFC,4 8 40 16 4 -64
IFC,5 8 50 20 5 -80
80
R: 5 5 5 5 5 5 10 10 10 10 10 4 4 4 4 4 6 6 4 4 4 4
25
25
25
25
25
25
100
100
100
100
100
16
16
16
16
16
36
36
16
16
16
16

R2:
Σ R: 128
2
Σ (R ): 866

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE LEVELING 2

Backward Cycle 1
1, Stage 1 A E
6 D1 12
Step 1 Step 2
A E B D
2 1 3 5
R: 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 10 7 A E
C D2
D1 F
B D 5 6
1 3 5 Sta B D End
R: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 4
D2
C F C F
4
R: 8 8 8 8 8 2 2 2 2 2 2
Minimum Moment Algorithm
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
m m
IFA, n = r (  xi -  wi - mr )
13 1 1
12
11 Stage Step Act. IF r Σ xi Σ wi m IF Action for
10 next stage
9 B1-1 1 C IFC,1 8 10 5 1 -24
8 IFC,2 8 20 10 2 -48
7 IFC,3 8 30 15 3 -72
6 IFC,4 8 40 20 4 -96
5 IFC,5 8 50 25 5 -120
4 IFC,6 8 50 25 5 -120
3
2
1

R: 5 5 5 5 5 5 10 10 10 10 10 4 4 4 4 4 6 6 4 4 4 4
25
25
25
25
25
25

16
16
16
16
16
36
36
16
16
16
16
100
100
100
100
100

R2:
Σ R: 128
2
Σ (R ): 866

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

RESOURCE LEVELING 2

Backward Cycle 1
1, Stage 2 A E
6 D1 12
Step 1 Step 2
A E B D
2 1 3 5
R: 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 10 7 A E
C D2 F
D1
B D 5 6
1 3 5 Sta B D End
R: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 4
D2
C F C F
4
R: 8 8 8 8 8 2 2 2 2 2 2
Minimum Moment Algorithm
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
m m
IFA, n = r (  xi -  wi - mr )
13 1 1
12
11 Stage Step Act. IF r Σ xi Σ wi m IF Action for
10 next stage
9 B1-2 2 D IFD,1 2 6 10 1 -12
8
7 2 F IFF,1 2 4 4 1 -4
6 IFF,2 2 8 8 2 -8
5 IFF,3 2 12 12 3 -12
12
4 IFF,4 2 16 16 4 -16
3 IFF,5 2 22 20 5 -16 (FINAL)
2
1

R: 5 5 5 5 5 5 10 10 10 10 10 4 4 4 4 4 6 6 4 4 4 4
25
25
25
25
25
25

16
16
16
16
16
36
36
16
16
16
16
100
100
100
100
100

R2:
Σ R: 128
2
Σ (R ): 866

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

Exercise 1 Act. Dur. Succ. Type of Lag Tabel di samping ini dipersiapkan untuk analisis
(days) dep. (days) sumberdaya pada sebuah proyek.
A 2 B FS 0
D FS 0 Agar masing-masing kegiatan dapat terlaksana,
B 2 C FS 0 diperlukan sumber daya sebanyak 2, 1, 2, 2, 2,
C 2 - - - 1, 1, 2 tukang (men) per hari berturut-turut untuk
D 3 E FS 0 kegiatan A, B, C, D, E, F, G, H tersebut.
H FS 0
E 4 C FS 0 Adapun jumlah tukang yang tersedia (resource
F 1 G FS 0 availability) adalah 3 tukang (men) per hari.
G 3 H FS 0
Data-data di atas dapat digambarkan dalam
H 1 C FS 0
bentuk barchart di bawah ini:

ID -1 1 2 3 4 5 6 7 8 9 10 11 12 13
1
2 A Men[2]
3 B Men
4 C Men[2]
5 D Men[2]
6 E Men[2]
[ ]
7 F Men
8 G Men
9 H Men[2]

a. Gambarkan Resource Loading Histogram untuk kondisi awal, hitung Σ R2.

Keterangan: R = total daily resource requirement.
b. Lakukan Resource Leveling dengan Minimum Moment Algorithm.
Pada tiap iterasi: diminta Barchart, Histogram hitung Σ R2
Barchart Resource Loading Histogram,
c. Lakukan Resource Allocation karena keterbatasan sumber daya.
Pada tiap iterasi: diminta Barchart dan Resource Loading Histogram.

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

 Project Planning, Scheduling and Control

Exercise 2 Sebuah proyek terdiri dari beberapa kegiatan. Durasi dan kebutuhan pasokan beton
untuk masing-masing kegiatan ditabulasikan sebagai berikut:

Kegiatan
A B C D E F G H I J K L
Durasi
1h 2h 1h 1h 2h 3h 3h 2h 1h 2h 3h 1h
(hari)
Kebutuhan beton
4 3 3 1 2 1 2 4 3 2 1 5
(m3 per hari)

Arrow Diagram Network untuk proyek tersebut adalah:

Apabila dikehendaki agar fluktuasi total pasokan beton per hari adalah seminimal
mungkin tanpa mengubah durasi proyek
proyek, lakukan Resource Leveling dengan metode
Minimum Moment Algorithm yang formulanya sebagai berikut:

 m m

IFA, n = r    wi - m.r 
xi -
 1 1 
Berikan kesimpulan, kegiatan apa saja dan berapa lama harus ‘digeser’
pelaksanaannya untuk mencapai tujuan di atas.

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.