36 namespace Gecode {
namespace Int {
namespace Cumulative {
39 template<
class ManTask>
43 sort<typename TaskTraits<ManTask>::TaskViewFwd,
STO_LCT,
true>(
f);
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.
@ ES_OK
Execution is okay.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
ExecStatus overload(Space &home, int c, TaskArray< ManTask > &t)
Check mandatory tasks t for overload.
@ STO_LCT
Sort by latest completion times.
Gecode::FloatVal c(-8, 8)
Gecode::IntArgs i({1, 2, 3, 4})