39 template<
class ManTask>
48 for (
int i=0; i<f.
size(); i++) {
51 if (o.
env() >
static_cast<long long int>(c)*f[i].lct())
Omega trees for computing ect of task sets.
long long int env(void) const
Return energy envelope of all tasks.
void insert(int i)
Insert task with index i.
int size(void) const
Return size of array (number of elements).
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Scheduling for cumulative resources
ExecStatus overload(Space &home, int c, TaskArray< ManTask > &t)
Check mandatory tasks t for overload.
void sort(TaskViewArray< TaskView > &t)
Sort task view array t according to sto and inc (increasing or decreasing).
@ STO_LCT
Sort by latest completion times.
Gecode toplevel namespace
@ ES_OK
Execution is okay.