ProjectManagement (version 1.5.2)

levelling.resources: Project resource levelling

Description

This function calculates the schedule of the project so that the consumption of resources is as uniform as possible.

Usage

levelling.resources(
  duration,
  prec1and2 = matrix(0),
  prec3and4 = matrix(0),
  resources,
  int = 1
)

Value

A solution matrices.

Arguments

duration

Vector with the duration for each activity.

prec1and2

A matrix indicating the order of precedence type 1 and 2 between the activities (Default=matrix(0)). If value \((i,j)=1\) then activity \(i\) precedes type \(1\) to \(j\), and if \((i,j)=2\) then activity \(i\) precedes type \(2\) to \(j\). Cycles cannot exist in a project, i.e. if an activity \(i\) precedes \(j\) then \(j\) cannot precede \(i\).

prec3and4

A matrix indicating the order of precedence type 3 and 4 between the activities (Default=matrix(0)). If value \((i,j)=3\) then activity \(i\) precedes type \(3\) to \(j\), and if \((i,j)=4\) then activity \(i\) precedes type \(4\) to \(j\). Cycles cannot exist in a project, i.e. if an activity \(i\) precedes \(j\) then \(j\) cannot precede \(i\).

resources

Vector indicating the necessary resources for each activity per period of time.

int

Numerical value indicating the duration of each period of time (Default=1).

Details

The problem of leveling resources takes into account that in order for activities to be carried out in the estimated time, a certain level of resources must be used. The problem is to find a schedule that allows to execute the project in the estimated time so that the temporary consumption of resources is as level as possible.

References

heg

Hegazy, T. (1999). Optimization of resource allocation and leveling using genetic algorithms. Journal of construction engineering and management, 125(3), 167-175.

Examples

duration<-c(3,4,2,1)
resources<-c(4,1,3,3)
prec1and2<-matrix(c(0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0),nrow=4,ncol=4,byrow=TRUE)

levelling.resources(duration,prec1and2,prec3and4=matrix(0),resources,int=1)