IBM ILOG Scheduler User's Manual > Local Search in Scheduler > Tabu Search for the Jobshop Problem > Solving the Problem > Creating an IloSchedulerSolution |
Creating an IloSchedulerSolution |
INDEX
![]() |
As with any local search in Scheduler implementation, it is necessary to construct an IloSchedulerSolution
object that will be the central data structure in the local search protocol.
In this case, we create the IloSchedulerSolution
as we did in the previous chapter with one exception. In the code above that calculates and stores the previous resource constraints, the main loop iterates over the resources that are stored in the solution. It is necessary, therefore, to actually add the resources to the solution.
In summary, we create the local search solution by cloning the existing solution, adding the resource constraints and specifying that they are to restore their next resource constraints, and by adding the resources.
© Copyright IBM Corp. 1987, 2009. Legal terms. | PREVIOUS NEXT |