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
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.
This function creates propagators for the cumulatives constraint presented in "A new multi-resource 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 value-consistency only (icl = ICL_VAL, default).
- Exceptions:
-
Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::NumericalOverflow thrown if any numerical argument is larger than Limits::Int::int_max or less than Limits::Int::int_min.
Definition at line 128 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 | |||
) |
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multi-resource 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 value-consistency only (icl = ICL_VAL, default).
- Exceptions:
-
Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::NumericalOverflow thrown if any numerical argument is larger than Limits::Int::int_max or less than Limits::Int::int_min.
Definition at line 138 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 | |||
) |
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multi-resource 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 value-consistency only (icl = ICL_VAL, default).
- Exceptions:
-
Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::NumericalOverflow thrown if any numerical argument is larger than Limits::Int::int_max or less than Limits::Int::int_min.
Definition at line 148 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 | |||
) |
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multi-resource 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 value-consistency only (icl = ICL_VAL, default).
- Exceptions:
-
Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::NumericalOverflow thrown if any numerical argument is larger than Limits::Int::int_max or less than Limits::Int::int_min.
Definition at line 158 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 | |||
) |
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multi-resource 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 value-consistency only (icl = ICL_VAL, default).
- Exceptions:
-
Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::NumericalOverflow thrown if any numerical argument is larger than Limits::Int::int_max or less than Limits::Int::int_min.
Definition at line 168 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 | |||
) |
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multi-resource 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 value-consistency only (icl = ICL_VAL, default).
- Exceptions:
-
Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::NumericalOverflow thrown if any numerical argument is larger than Limits::Int::int_max or less than Limits::Int::int_min.
Definition at line 178 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 | |||
) |
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multi-resource 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 value-consistency only (icl = ICL_VAL, default).
- Exceptions:
-
Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::NumericalOverflow thrown if any numerical argument is larger than Limits::Int::int_max or less than Limits::Int::int_min.
Definition at line 188 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 | |||
) |
Post propagators for the cumulatives constraint.
Post propagators for the cumulatives constraint.
This function creates propagators for the cumulatives constraint presented in "A new multi-resource 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 value-consistency only (icl = ICL_VAL, default).
- Exceptions:
-
Int::ArgumentSizeMismatch thrown if the sizes of the arguments representing tasks does not match. Int::NumericalOverflow thrown if any numerical argument is larger than Limits::Int::int_max or less than Limits::Int::int_min.
Definition at line 198 of file cumulatives.cc.