Scheduling constraints
[Using finite domain integers]
Collaboration diagram for Scheduling constraints:
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) 
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) 
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) 
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) 
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) 
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) 
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) 
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) 
Post propagators for the cumulatives constraint. 
Function Documentation

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).
Definition at line 128 of file cumulatives.cc. 

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).
Definition at line 138 of file cumulatives.cc. 

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).
Definition at line 148 of file cumulatives.cc. 

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).
Definition at line 158 of file cumulatives.cc. 

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).
Definition at line 168 of file cumulatives.cc. 

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).
Definition at line 178 of file cumulatives.cc. 

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).
Definition at line 188 of file cumulatives.cc. 

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).
Definition at line 198 of file cumulatives.cc. 