cp_get_default_schedule_strategy
cp_get_default_schedule_strategy |
Purpose
The cp_schedule search algorithm is decomposed in two distinct phases. The target of the first phase is finding quickly a near optimal heuristic solution. The second and last phase focuses on improving the bound and proving optimality.
Synopsis
procedure cp_get_default_schedule_strategy(phase:integer, branching:cpbranching)
Arguments
|
phase
|
algorithm phase (
KALIS_INITIAL_SOLUTION,
KALIS_OPTIMAL_SOLUTION)
|
|
branching
|
the search strategy
|
Example
The following example shows how to set the search stragey for the cp_schedule function
cp_set_schedule_strategy(KALIS_INITIAL_SOLUTION,
assign_var(KALIS_SMALLEST_MIN,KALIS_MIN_TO_MAX))
Related topics