KALIS_TIMETABLING
Description
|
Timetabling propagation type for resource constraints
|
||
Type
|
Integer, read only
|
||
Values
|
|
||
Notes
|
This constant is passed to the
set_resource_attributes function to specify the kind of propagation to be used for filtering the resource constraint. The KALIS_TIMETABLING filtering algorithm achieves a very simple and fast filtering. Although less powerful than the algorithms KALIS_DISJUNCTIONS (unary resources only) and KALIS_TASK_INTERVALS that may lead to a stronger pruning, the speed of the KALIS_TIMETABLING filtering allows the search process to explore more nodes in the same amount of time which makes the algorithm competitive for simple problems and also for very large problems where the computational overhead of other filtering algorithms is prohibitive.
|
||
See also
|
© 2001-2019 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.