Jerome Rogerie

Learn More
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Constraint-Based Scheduling, those problems are usually handled by defining new global constraints over classical integer variables. The approach described in this paper takes a(More)
In version 2.0, IBM ILOG CP Optimizer has been extended by the introduction of scheduling support based on the concept of optional interval variables. This paper formally describes the new modeling language features available to the users of CP Optimizer for resource-based scheduling. We show that the new language is flexible enough to model problems never(More)
In constraint-based scheduling, storage systems are modelled by a class of resource called reservoir. Activities can either produce or consume a capacity in a reservoir. Most of the models presented in the literature assume that the production and the consumption is instantaneous but they are not good for some class of problems. This paper introduces the(More)
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notations from modeling languages with a rich constraint language and the ability to specify search procedures and strategies that are the essence of constraint programming. In addition,(More)
  • 1