C++ Reference: class SchedulingNeighborhoodGenerator

This documentation is automatically generated.

Only make sense for scheduling problem. This select a random set of interval of the problem according to the difficulty. Then, for each no_overlap constraints, it adds strict relation order between the non-relaxed intervals.

TODO(user): Also deal with cumulative constraint.

Method

Method
`Generate`	Return type: `Neighborhood` Arguments: `const CpSolverResponse& initial_solution, double difficulty, absl::BitGenRef random`
`SchedulingNeighborhoodGenerator`	Return type: `explicit` Arguments: `NeighborhoodGeneratorHelper const* helper, const std::string& name`

Generate

Return type: Neighborhood

Arguments: const CpSolverResponse& initial_solution, double difficulty, absl::BitGenRef random

SchedulingNeighborhoodGenerator

Return type: explicit

Arguments: NeighborhoodGeneratorHelper const* helper, const std::string& name

Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.

Last updated 2021-07-30 UTC.