Stay organized with collections
Save and categorize content based on your preferences.
Note: This documentation is automatically generated.
A strongly quadratic version of Time Tabling filtering. This propagator
is similar to the CumulativeTimeTable propagator of the constraint solver.
TODO(user): Use SchedulingDemandHelper. In particular, if we know the task
is from a set of fixed alternatives, we might be able to push it more.
| Method |
Propagate | Return type: bool |
RegisterWith | Return type: void Arguments: GenericLiteralWatcher* watcher |
TimeTablingPerTask | Arguments: AffineExpression capacity,
SchedulingConstraintHelper* helper,
SchedulingDemandHelper* demands, Model* model |
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 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["The `TimeTablingPerTask` class in C++ implements a strongly quadratic time tabling filter, similar to `CumulativeTimeTable`. It features a `Propagate` method (returning a boolean) and a `RegisterWith` method (taking a `GenericLiteralWatcher`). The constructor `TimeTablingPerTask` takes arguments for `capacity`, `SchedulingConstraintHelper`, `SchedulingDemandHelper`, and a `Model`. There is a planned improvement to leverage `SchedulingDemandHelper`, particularly for tasks with fixed alternatives.\n"],null,[]]
