FRAMES NO FRAMES

operator<=

public IlcConstraint operator<=(IlcIntTimetable, IlcIntToIntStepFunction)
public IlcConstraint operator<(IlcIntTimetable, IlcIntToIntStepFunction)
public IlcConstraint operator>=(IlcIntTimetable, IlcIntToIntStepFunction)
public IlcConstraint operator>(IlcIntTimetable, IlcIntToIntStepFunction)
public IlcConstraint operator==(IlcIntTimetable, IlcIntToIntStepFunction)
public IlcConstraint operator<=(IlcIntToIntStepFunction f, IlcIntTimetable t)
public IlcConstraint operator<(IlcIntToIntStepFunction f, IlcIntTimetable t)
public IlcConstraint operator>=(IlcIntToIntStepFunction f, IlcIntTimetable t)
public IlcConstraint operator>(IlcIntToIntStepFunction f, IlcIntTimetable t)
public IlcConstraint operator==(IlcIntToIntStepFunction f, IlcIntTimetable t)
Definition file: ilsched/timetabh.h
Include file: <ilsched/ilsched.h>

These constraint operators create constraints between an integer step function and an integer timetable that constrain the maximal (or minimal) availability profile of the resources.

Note
Any modification of the IlcIntToIntStepFunction argument after the constraint has been posted will have no effect on the constraint.

Example

The following code defines an integer step function capMax and uses it to constrain the maximal availability profile of a discrete resource res.

 // Must be during search (e.g., inside a goal)
   IloSolver solver = getSolver();
 IlcScheduler schedule(solver, 0, 100);

 IlcDiscreteResource res(schedule,10);
 IlcIntToIntStepFunction capMax(solver,0,100);
 capMax.setSteps(IlcIntArray(solver,3,30,50,90),
                 IlcIntArray(solver,4,10,8,6,10));
 solver.add(res.getTimetable() >= capMax); // ...