Scheduling constraints
[Using finite domain integers]
Functions  
void  Gecode::cumulatives (Space *home, const IntVarArgs &machine, const IntVarArgs &start, const IntVarArgs &duration, const IntVarArgs &end, const IntVarArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF) 
Post propagators for the cumulatives constraint.  
void  Gecode::cumulatives (Space *home, const IntArgs &machine, const IntVarArgs &start, const IntVarArgs &duration, const IntVarArgs &end, const IntVarArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF) 
Post propagators for the cumulatives constraint.  
void  Gecode::cumulatives (Space *home, const IntVarArgs &machine, const IntVarArgs &start, const IntArgs &duration, const IntVarArgs &end, const IntVarArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF) 
Post propagators for the cumulatives constraint.  
void  Gecode::cumulatives (Space *home, const IntArgs &machine, const IntVarArgs &start, const IntArgs &duration, const IntVarArgs &end, const IntVarArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF) 
Post propagators for the cumulatives constraint.  
void  Gecode::cumulatives (Space *home, const IntVarArgs &machine, const IntVarArgs &start, const IntVarArgs &duration, const IntVarArgs &end, const IntArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF) 
Post propagators for the cumulatives constraint.  
void  Gecode::cumulatives (Space *home, const IntArgs &machine, const IntVarArgs &start, const IntVarArgs &duration, const IntVarArgs &end, const IntArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF) 
Post propagators for the cumulatives constraint.  
void  Gecode::cumulatives (Space *home, const IntVarArgs &machine, const IntVarArgs &start, const IntArgs &duration, const IntVarArgs &end, const IntArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF) 
Post propagators for the cumulatives constraint.  
void  Gecode::cumulatives (Space *home, const IntArgs &machine, const IntVarArgs &start, const IntArgs &duration, const IntVarArgs &end, const IntArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF) 
Post propagators for the cumulatives constraint. 
Function Documentation
void Gecode::cumulatives  (  Space *  home,  
const IntVarArgs &  machine,  
const IntVarArgs &  start,  
const IntVarArgs &  duration,  
const IntVarArgs &  end,  
const IntVarArgs &  height,  
const IntArgs &  limit,  
bool  at_most,  
IntConLevel  icl = ICL_DEF , 

PropKind  pk = PK_DEF  
) 
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multiresource cumulatives constraint with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.
The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.
The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false).
 Parameters:

machine is the machine assigned to task start is the start date assigned to task duration is the duration of task end is the end date assigned to task height is the height is the amount of resources consumed by task limit is the amount of resource available for machine at_most at_most tells if the amount of resources used for a machine should be less than the limit (at_most = true) or greater than the limit (at_most = false) icl Supports valueconsistency only (icl = ICL_VAL, default).
 Exceptions:

Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::OutOfLimits thrown if any numerical argument is larger than Int::Limits::max or less than Int::Limits::min.
Definition at line 135 of file cumulatives.cc.
void Gecode::cumulatives  (  Space *  home,  
const IntArgs &  machine,  
const IntVarArgs &  start,  
const IntVarArgs &  duration,  
const IntVarArgs &  end,  
const IntVarArgs &  height,  
const IntArgs &  limit,  
bool  at_most,  
IntConLevel  icl = ICL_DEF , 

PropKind  pk = PK_DEF  
) 
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multiresource cumulatives constraint with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.
The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.
The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false).
 Parameters:

machine is the machine assigned to task start is the start date assigned to task duration is the duration of task end is the end date assigned to task height is the height is the amount of resources consumed by task limit is the amount of resource available for machine at_most at_most tells if the amount of resources used for a machine should be less than the limit (at_most = true) or greater than the limit (at_most = false) icl Supports valueconsistency only (icl = ICL_VAL, default).
 Exceptions:

Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::OutOfLimits thrown if any numerical argument is larger than Int::Limits::max or less than Int::Limits::min.
Definition at line 145 of file cumulatives.cc.
void Gecode::cumulatives  (  Space *  home,  
const IntVarArgs &  machine,  
const IntVarArgs &  start,  
const IntArgs &  duration,  
const IntVarArgs &  end,  
const IntVarArgs &  height,  
const IntArgs &  limit,  
bool  at_most,  
IntConLevel  icl = ICL_DEF , 

PropKind  pk = PK_DEF  
) 
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multiresource cumulatives constraint with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.
The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.
The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false).
 Parameters:

machine is the machine assigned to task start is the start date assigned to task duration is the duration of task end is the end date assigned to task height is the height is the amount of resources consumed by task limit is the amount of resource available for machine at_most at_most tells if the amount of resources used for a machine should be less than the limit (at_most = true) or greater than the limit (at_most = false) icl Supports valueconsistency only (icl = ICL_VAL, default).
 Exceptions:

Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::OutOfLimits thrown if any numerical argument is larger than Int::Limits::max or less than Int::Limits::min.
Definition at line 155 of file cumulatives.cc.
void Gecode::cumulatives  (  Space *  home,  
const IntArgs &  machine,  
const IntVarArgs &  start,  
const IntArgs &  duration,  
const IntVarArgs &  end,  
const IntVarArgs &  height,  
const IntArgs &  limit,  
bool  at_most,  
IntConLevel  icl = ICL_DEF , 

PropKind  pk = PK_DEF  
) 
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multiresource cumulatives constraint with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.
The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.
The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false).
 Parameters:

machine is the machine assigned to task start is the start date assigned to task duration is the duration of task end is the end date assigned to task height is the height is the amount of resources consumed by task limit is the amount of resource available for machine at_most at_most tells if the amount of resources used for a machine should be less than the limit (at_most = true) or greater than the limit (at_most = false) icl Supports valueconsistency only (icl = ICL_VAL, default).
 Exceptions:

Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::OutOfLimits thrown if any numerical argument is larger than Int::Limits::max or less than Int::Limits::min.
Definition at line 165 of file cumulatives.cc.
void Gecode::cumulatives  (  Space *  home,  
const IntVarArgs &  machine,  
const IntVarArgs &  start,  
const IntVarArgs &  duration,  
const IntVarArgs &  end,  
const IntArgs &  height,  
const IntArgs &  limit,  
bool  at_most,  
IntConLevel  icl = ICL_DEF , 

PropKind  pk = PK_DEF  
) 
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multiresource cumulatives constraint with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.
The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.
The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false).
 Parameters:

machine is the machine assigned to task start is the start date assigned to task duration is the duration of task end is the end date assigned to task height is the height is the amount of resources consumed by task limit is the amount of resource available for machine at_most at_most tells if the amount of resources used for a machine should be less than the limit (at_most = true) or greater than the limit (at_most = false) icl Supports valueconsistency only (icl = ICL_VAL, default).
 Exceptions:

Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::OutOfLimits thrown if any numerical argument is larger than Int::Limits::max or less than Int::Limits::min.
Definition at line 175 of file cumulatives.cc.
void Gecode::cumulatives  (  Space *  home,  
const IntArgs &  machine,  
const IntVarArgs &  start,  
const IntVarArgs &  duration,  
const IntVarArgs &  end,  
const IntArgs &  height,  
const IntArgs &  limit,  
bool  at_most,  
IntConLevel  icl = ICL_DEF , 

PropKind  pk = PK_DEF  
) 
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multiresource cumulatives constraint with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.
The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.
The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false).
 Parameters:

machine is the machine assigned to task start is the start date assigned to task duration is the duration of task end is the end date assigned to task height is the height is the amount of resources consumed by task limit is the amount of resource available for machine at_most at_most tells if the amount of resources used for a machine should be less than the limit (at_most = true) or greater than the limit (at_most = false) icl Supports valueconsistency only (icl = ICL_VAL, default).
 Exceptions:

Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::OutOfLimits thrown if any numerical argument is larger than Int::Limits::max or less than Int::Limits::min.
Definition at line 185 of file cumulatives.cc.
void Gecode::cumulatives  (  Space *  home,  
const IntVarArgs &  machine,  
const IntVarArgs &  start,  
const IntArgs &  duration,  
const IntVarArgs &  end,  
const IntArgs &  height,  
const IntArgs &  limit,  
bool  at_most,  
IntConLevel  icl = ICL_DEF , 

PropKind  pk = PK_DEF  
) 
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multiresource cumulatives constraint with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.
The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.
The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false).
 Parameters:

machine is the machine assigned to task start is the start date assigned to task duration is the duration of task end is the end date assigned to task height is the height is the amount of resources consumed by task limit is the amount of resource available for machine at_most at_most tells if the amount of resources used for a machine should be less than the limit (at_most = true) or greater than the limit (at_most = false) icl Supports valueconsistency only (icl = ICL_VAL, default).
 Exceptions:

Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::OutOfLimits thrown if any numerical argument is larger than Int::Limits::max or less than Int::Limits::min.
Definition at line 195 of file cumulatives.cc.
void Gecode::cumulatives  (  Space *  home,  
const IntArgs &  machine,  
const IntVarArgs &  start,  
const IntArgs &  duration,  
const IntVarArgs &  end,  
const IntArgs &  height,  
const IntArgs &  limit,  
bool  at_most,  
IntConLevel  icl = ICL_DEF , 

PropKind  pk = PK_DEF  
) 
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multiresource cumulatives constraint with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.
The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.
The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false).
 Parameters:

machine is the machine assigned to task start is the start date assigned to task duration is the duration of task end is the end date assigned to task height is the height is the amount of resources consumed by task limit is the amount of resource available for machine at_most at_most tells if the amount of resources used for a machine should be less than the limit (at_most = true) or greater than the limit (at_most = false) icl Supports valueconsistency only (icl = ICL_VAL, default).
 Exceptions:

Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::OutOfLimits thrown if any numerical argument is larger than Int::Limits::max or less than Int::Limits::min.
Definition at line 205 of file cumulatives.cc.