t[i] = new Task(s[i],d[i],e[i]);
solver.post(ICF.arithm(e[i],"<=",last));
}
Constraint c = ICF.cumulative(t,h,capa,graph);
solver.post(c);
solver.set(ISF.random_bound(solver.retrieveIntVars(), seed));
solver.set(ISF.lastConflict(solver,solver.getStrategy()));
SMF.limitTime(solver,5000);
switch (mode){
case 0: solver.findSolution();
// print(solver,last,graph,f);