Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::sat::CachedTaskBounds Struct Reference

#include <intervals.h>

Public Member Functions

bool operator< (CachedTaskBounds other) const
 
bool operator> (CachedTaskBounds other) const
 

Public Attributes

int task_index
 
LiteralIndex presence_lit
 
IntegerValue time
 

Detailed Description

We have some free space in TaskTime. We stick the presence_lit to save an indirection in some algo.

Todo
(user): Experiment caching more value. In particular TaskByIncreasingShiftedStartMin() could tie break task for better heuristics?

Definition at line 251 of file intervals.h.

Member Function Documentation

◆ operator<()

bool operations_research::sat::CachedTaskBounds::operator< ( CachedTaskBounds other) const
inline

Definition at line 255 of file intervals.h.

◆ operator>()

bool operations_research::sat::CachedTaskBounds::operator> ( CachedTaskBounds other) const
inline

Definition at line 256 of file intervals.h.

Member Data Documentation

◆ presence_lit

LiteralIndex operations_research::sat::CachedTaskBounds::presence_lit

Definition at line 253 of file intervals.h.

◆ task_index

int operations_research::sat::CachedTaskBounds::task_index

Definition at line 252 of file intervals.h.

◆ time

IntegerValue operations_research::sat::CachedTaskBounds::time

Definition at line 254 of file intervals.h.


The documentation for this struct was generated from the following file: