DisjunctivePropagator::Tasks

Detailed Description

A structure to hold tasks described by their features.

The first num_chain_tasks are considered linked by a chain of precedences, i.e. if i < j < num_chain_tasks, then end(i) <= start(j). This occurs frequently in routing, and can be leveraged by some variants of classic propagators.

Definition at line 1773 of file routing.h.

Public Member Functions
void	Clear ()

Public Attributes
int	num_chain_tasks = 0
std::vector< int64 >	start_min
std::vector< int64 >	start_max
std::vector< int64 >	duration_min
std::vector< int64 >	duration_max
std::vector< int64 >	end_min
std::vector< int64 >	end_max
std::vector< bool >	is_preemptible
std::vector< const SortedDisjointIntervalList * >	forbidden_intervals
std::vector< std::pair< int64, int64 > >	distance_duration

Member Function Documentation

Clear()

void Clear ( )

inline

Definition at line 1785 of file routing.h.

Member Data Documentation

distance_duration

std::vector<std::pair<int64, int64> > distance_duration

Definition at line 1783 of file routing.h.

duration_max

std::vector<int64> duration_max

Definition at line 1778 of file routing.h.

duration_min

std::vector<int64> duration_min

Definition at line 1777 of file routing.h.

end_max

std::vector<int64> end_max

Definition at line 1780 of file routing.h.

end_min

std::vector<int64> end_min

Definition at line 1779 of file routing.h.

forbidden_intervals

std::vector<const SortedDisjointIntervalList*> forbidden_intervals

Definition at line 1782 of file routing.h.

is_preemptible

std::vector<bool> is_preemptible

Definition at line 1781 of file routing.h.

num_chain_tasks

int num_chain_tasks = 0

Definition at line 1774 of file routing.h.

start_max

std::vector<int64> start_max

Definition at line 1776 of file routing.h.

start_min

std::vector<int64> start_min

Definition at line 1775 of file routing.h.

---

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

• routing.h