Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <disjunctive.h>
Public Member Functions | |
DisjunctiveNotLast (bool time_direction, SchedulingConstraintHelper *helper, Model *model=nullptr) | |
bool | Propagate () final |
int | RegisterWith (GenericLiteralWatcher *watcher) |
Public Member Functions inherited from operations_research::sat::PropagatorInterface | |
PropagatorInterface ()=default | |
virtual | ~PropagatorInterface ()=default |
virtual bool | IncrementalPropagate (const std::vector< int > &) |
Definition at line 289 of file disjunctive.h.
|
inline |
Definition at line 291 of file disjunctive.h.
|
finalvirtual |
This will be called after one or more literals that are watched by this propagator changed. It will also always be called on the first propagation cycle after registration.
Split problem into independent part.
The situation is trickier here, and we use two windows:
Now, a task from the second window can be detected to be "not last" by only looking at the task in the first window. Tasks to the left do not cause issue for the task to be last, and tasks to the right will not lower the end-min of the task under consideration.
Add to start_max_window_ all the task whose start_max fall into [window_start, window_end).
If this is the case, we cannot propagate more than the detectable precedence propagator. Note that this continue must happen after we computed start_max_window_ though.
Process current window.
Implements operations_research::sat::PropagatorInterface.
Definition at line 1322 of file disjunctive.cc.
int operations_research::sat::DisjunctiveNotLast::RegisterWith | ( | GenericLiteralWatcher * | watcher | ) |
Definition at line 1522 of file disjunctive.cc.