mce {ProjectManagement}

Build a precedence matrix

Description

This function calculates the costs per activity to accelerate the project.

Usage

mce(
  duration,
  minimum.durations,
  prec1and2 = matrix(0),
  prec3and4 = matrix(0),
  activities.costs,
  duration.project = NULL
)

Arguments

duration

Vector with the duration for each activity.

minimum.durations

Vector with the Minimum duration allowed 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.

activities.costs

Vector indicating the cost of accelerating a unit of time the duration of each activity.

duration.project

numerical value indicating the minimum time sought in the project (Default=NULL).

Details

The MCE method (Minimal Cost Expediting) tries to speed up the project at minimum cost. It considers that the duration of some project activities could be reduced by increasing the resources allocated to them (and thus increasing their implementation costs).

Value

A solution matrices.

References

kelley

Kelley Jr, J. E. (1961). Critical-path planning and scheduling: Mathematical basis. Operations research, 9(3), 296-320.

Examples

duration<-c(5,4,5,2,2)
minimum.durations<-c(3,2,3,1,1)
activities.costs<-c(1,1,1,1,1)
prec1and2<-matrix(c(0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0),nrow=5,ncol=5,byrow=TRUE)
duration.project<-6

mce(duration,minimum.durations,prec1and2,prec3and4=matrix(0),activities.costs,duration.project)