Resources Management

Resources Management
What a resource?

Any thing that is used by an activity to get the work done, such as: Material, Equipment, Labor, Money, ..

Resources can be classified as:

Consumable (Money, Material,) Non Consumable (Labor, Equipment,)

13/01/2002

Emad Elbeltagi

Resources Management
Duration-Driven Schedule

All CPM scheduling techniques are duration driven schedules Basic units: activities, durations, relationships Assumes resources are available whenever needed Also, resources can be classified as:

Key or constrained resources (Skilled labor, Equipment,) Secondary or non-constrained resources (Labor, ) General resources, used by all activities
Emad Elbeltagi

13/01/2002

Resources Management
Resource aggregation or Resource loading

The summation, on a period-by-period basis, of the resources required to complete all activities based on the schedule carried out in the previous stage

The results are usually shown graphically as a histogram A separate graph will be required for each resource

13/01/2002

Emad Elbeltagi

Resources Management
Resource aggregation or Resource loading

Consider the following activities

Activity

Duration (Weeks)

Resources (units/week)

A B C D E

2 3 2 5 2

Shown in the histogram

Resource limit = 10 units /week

13/01/2002

Emad Elbeltagi

Resources Management
Resource aggregation or Resource loading

Resource limit

13/01/2002

Emad Elbeltagi

Resources Management
Resource aggregation or Resource loading

13/01/2002

Emad Elbeltagi

Resources Management
Problems Associated with Resource

Resource Fluctuation (Resource leveling) Resource Over allocation (Resource Scheduling)

Resource

Resource

Resource limit

Time
Resource profile with high resource fluctuation (High hiring and firing) Less hiring and firing (More stable work conditions)

Time

13/01/2002

Emad Elbeltagi

Resources Management
Methods for Resolving Resource conflicts (Problems)

Optimization Models (Utilize optimization techniques):

Linear programming models Advantages: Provide optimum solution Limitations: Cannot be applied to large problems

Heuristic Models (Utilize rule of thumb based on experience):

Heuristic or rules of thumb Advantages: Can be applied to large problems Limitations: Do not provide optimum solution

13/01/2002

Emad Elbeltagi

Resources Management
Resource Leveling (Smoothing)
Unconstrained resource scheduling (Constrained time) Resource Leveling

Resource unconstrained (No limits on resources) Time (Project completion) constrained; project duration not be delayed

Reduce the difference between the peaks and the valleys Average resource usage The objective is to smooth the use of the resources to avoid the resource fluctuation

13/01/2002

Emad Elbeltagi

Resources Management
Resource Leveling (Smoothing)

13/01/2002

Emad Elbeltagi

Resources Management
Resource Leveling (Smoothing)
Minimum Moment Algorithm = Yi * Yi /2

13/01/2002

Emad Elbeltagi

Resources Management
Resource Leveling (Smoothing)
Heuristic Method Procedure

Prepare a complete activity schedule Draw a bar chart based on ES timings Draw the FF as dashed line beside the upper side of the bar and the TF beside the lower side

Put the resource usage in each bar of the related activity Critical activities to be drawn first (do not move them) Aggregate the resources in each time period

13/01/2002

Emad Elbeltagi

Resources Management
Resource Leveling (Smoothing)
Procedure

Calculate the total usage of resources = unit period usage Calculate the average resource usage = usage / utilization period

Shift non-critical activities within their FF first, then their TF to decrease the peaks and raise the valleys

Revise the activities float Aggregate the resources in each time period

13/01/2002

Emad Elbeltagi

Resources Management
Resource Leveling (Example)
Example
Activity A B C D E F G H I J K L M N
13/01/2002

Duration (Weeks) 0 2 5 3 2 6 6 6 4 2 7 3 2 2

Predecessors 1 1 1 2 2 3 4 4 5, 6 6, 7 2, 8 2, 8, 9 10, 11, 12, 13

Resource (units/week) 0 0 2 2 1 2 3 1 0 4 2 2 4 0

Emad Elbeltagi

Resources Management
Resource Leveling (Example)
2 4 E (2) 14 16 0 2 B (2) 3 5 0 0 A (0) 0 0 0 5 C (5) 0 5 0 3 D (3) 6 9 2 8 F (6) 5 11 5 11 G (6) 5 11 3 9 H (6) 9 15 7 I (4) 12 16 13/01/2002 Emad Elbeltagi 3 10 J (2) 16 18 11 18 K (7) 11 18 9 12 L (3) 15 18 9 11 M (2) 16 18 18 20 N (2) 18 20 8

Resources Management
Resource Leveling (Example)
Activity A B C D E F G H I J K L M N ES 0 0 0 0 2 2 5 3 3 8 11 9 9 18 EF 0 2 5 3 4 8 11 9 7 10 18 12 11 20 FF 0 0 0 0 4 0 0 0 2 8 0 6 7 0 TF 0 3 0 6 12 3 0 6 9 8 0 6 7 0

13/01/2002

Emad Elbeltagi

Resources Management
Resource Leveling (Example)
0 1 2 3
C, 2

9 10 11 12 13 14 15 16 17 18 19 20
G, 3 K, 2 N, 0

B, 0 D, 2 E, 1 F, 2 H, 1 I, 0 J, 4 L, 2 M, 4

4 4 7

6 5 6

13 9 4

2 2

= 90

13/01/2002

Emad Elbeltagi

Resources Management
Resource Leveling (Example)
14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

13/01/2002

Emad Elbeltagi

Resources Management
Resource Leveling (Example)
0 1 2 3
C, 2

9 10 11 12 13 14 15 16 17 18 19 20
G, 3 K, 2 N, 0

B, 0 D, 2 E, 1 F, 2 H, 1 I, 0 J, 4 L, 2 M, 4

4 4 M (7 days) 4 4 J (6 days) L (2 days) 4 4 4 4

7 7 7 7

6 6 6 6

5 5 5 5

6 6 6 6

8 13 9 4 -4 -4 6 6 8 9 5 4 -4 -4 6 6 4 5 5 4 -2 -2 6 6 4 3 3 4

6 6

2 2 +4 +4 2 2 2 2 6 6 +4 +4 2 2 6 6 6 6 +2 +2 4 4 6 6 6 6

= 90

13/01/2002

Emad Elbeltagi

Resources Management
Resource Leveling (Example)
0 1 2 3
C, 2

9 10 11 12 13 14 15 16 17 18 19 20
G, 3 K, 2 N, 0

B, 0 D, 2 E, 1 F, 2 H, 1 I, 0 J, 4 L, 2 M, 4

E (10 days) H (2 days) F (1 days)

7 6 5 6 -1 -1 4 4 6 5 5 6 -1 -1 4 4 6 4 4 6 -2 4 4 4 4 4 6

4 4

4 4 6 +1 +1 6 6 4 3 3 4 5 5 6 +1 +1 6 6 4 4 4 4 5 5 6 +2 6 6 6 4 4 4 5 5 6
Emad Elbeltagi

6 6

3 4

6 6 6 6

6 6 6 6

6 6 6 6

= 90

13/01/2002

Resources Management
Resource Leveling (Example)
7 6 5 4 3 2 1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

13/01/2002

Emad Elbeltagi

Resources Management
Resource Scheduling
Constrained resource scheduling (Unconstrained time) Resource Scheduling

Constrained Resources Unconstrained project completion; project time may be delayed Reduce the resource usage to be less than the resource availability The objective is to meet the resources limits

13/01/2002

Emad Elbeltagi

Resources Management
Resource Scheduling
R
2 2 1 1 2 A B C D E
2 2 4 4 1 1 2 2

Resource limit = 2

R
2 2 1 1 2 A B C D E
2 2 2 2 1 1 2 2 2 2

13/01/2002

Emad Elbeltagi

Resources Management
Resource Scheduling

Is there is a way to prioritize activities That compete for the limited resources so that the net project delay is minimized?

13/01/2002

Emad Elbeltagi

Resources Management
Resource Scheduling
Resource Scheduling Rules of Thumb

Many rules have been experimented with Least TF were found to be most effective Least LS has the same effect as the least TF and doesnt require network recalculations

In case of a tie use least TF

13/01/2002

Emad Elbeltagi

Resources Management
Resource Scheduling
Procedure

Prepare a complete activity schedule Aggregate the daily resource demand If demand greater than available then determine activities compete for resources

Prioritize these activities based on their LS Allocate resources to some activities and delay the others Put your solution in table format

13/01/2002

Emad Elbeltagi

Resources Management
Resource Scheduling (Example)
Activity A B C D E F G H I J K Duration (Weeks) 6 4 2 8 4 10 16 8 6 6 10 Predecessors A D B B F E, H C G, J Resource (units/week) R18 3 6 4 0 4 0 4 2 4 5 2 R2 1 0 1 0 1 1 1 0 0 1 1 0

13/01/2002

Emad Elbeltagi

Resources Management
Resource Scheduling (Example)
0 4 A (4) 10 14 4 12 D (8) 14 22 12 16 E (4) 22 26

3, 0

0, 1
6 16 F (10) 8 18

4, 1
16 24 H (8) 18 26 24 30 I (6) 26 32

0, 1
0 0 Start (0) 0 0 0 6 B (6) 0 6 6 22 G (16) 6 22

2, 0

4, 1

22 32 K (10) 22 32

32 32 End (0) 32 32

6, 1
0 2 C (2) 14 16 2

4, 0

2, 0

8 J (6) 16 22

4, 0

5, 1

13/01/2002

Emad Elbeltagi

Current Time 0

Eligible Activities B A C G F A C G F C D G F D J G D J H

Resources

R18
6 3 4 4 0 3 4 4 0 4 0 4 0 0 5 4 0 5 2

R2 1
1 0 0 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 0

Duration 6 4 2 16 10 4 2 16 10 2 8 16 10 8 6 16 8 6 8

Earliest LS 0 10 14 6 8 10 14 14 14 14 16 14 16 18

Decision Start Delay Delay Start Start Start Delay Continue Continue Start Delay Continue Continue Delay Delay Continue Start Delay Start

Finish Time 6 22 16 10 22 16 12 22 16 22 24 24

10

12

16

Current Time 22

Eligible Activities D H J J E E K K I

Resources

R18
0 2 5 5 4 4 2

R2 1
1 0 1 1 1 1 0

Duration 8 8 6 6 4 4 10

Earliest LS 16 14 22 22 22

Decision Continue Continue Delay Start Delay Start Start

Finish Time 24 24 30 34 40

24

30

34

2 2

0 0

10 6

26

Continue Start

40 40