Initializing help system before first use

# cp_set_schedule_strategy

Purpose
The cp_schedule search algorithm is decomposed in two distinct phases. The first phase target the finding of an near optimal heuristic solution quiclly. The second and last phase focuses on improving the bound and prove optimality.
Synopsis
`procedure cp_set_schedule_strategy(phase:integer, arrayBranching:array(range) of cpbranching)`
`procedure cp_set_schedule_strategy(phase:integer, branching:cpbranching)`
Arguments

phase | algorithm phase KALIS_INITIAL_SOLUTION, KALIS_OPTIMAL_SOLUTION
branching | the search strategy
arrayBranching | the search strategies

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
KALIS_INITIAL_SOLUTION KALIS_OPTIMAL_SOLUTION cp_schedule
Parent Topic Scheduling

© 2001-2026 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.