Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class CumulativeIsAfterSubsetConstraint
Note: This documentation is automatically generated.
Given that the "tasks" are part of a cumulative constraint, this adds a
constraint that propagate the fact that: var >= max(end of substasks) +
offset.
TODO(user): I am not sure this is the best way, but it does at least push
the level zero bound on the large cumulative instances.
| Method |
CumulativeIsAfterSubsetConstraint | Arguments: IntegerVariable var,
AffineExpression capacity,
const std::vector<int>& subtasks,
const std::vector<IntegerValue>& offsets,
SchedulingConstraintHelper* helper,
SchedulingDemandHelper* demands,
Model* model |
Propagate | Return type: bool |
RegisterWith | Return type: void Arguments: GenericLiteralWatcher* watcher |
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 `CumulativeIsAfterSubsetConstraint` class in C++ enforces that a variable (`var`) is greater than or equal to the maximum end time of a subset of tasks (`subtasks`) plus an offset. It aims to push the bound on large cumulative instances. Key methods include the constructor, `Propagate` (returns a boolean), and `RegisterWith` (registers with a watcher). The constraint is defined using integer variables, affine expressions, task subsets, offsets, and helper classes.\n"],null,[]]
