We introduce a new generic scheme to guide backtrack search, called Conflict Ordering
Search (COS), that reorders variables on the basis of conflicts that happen during search …

Cumulative is an essential constraint in the CP framework, and is present in scheduling and
packing applications. The lightest filtering for the cumulative constraint is time-tabling. It has …

Abstract The Patient Transportation Problem (PTP) aims to bring patients to health centers
and to take them back home once the care has been delivered. All the requests are known …

We consider a cumulative scheduling problem where a task duration and resource
consumption are not fixed. The consumption profile of the task, which can vary continuously …

In Operation Research, practical evaluation is essential to validate the efficacy of
optimization approaches. This paper promotes the usage of performance profiles as a …

Propagation is at the very core of t can provide signi: it can provide significant performance
boosts as long as the search space reduction is not outweighed by the cost for running the …

This thesis presents the application of several Constraint Programming (CP) techniques to
combinatorial problems. In particular, hybrid scheduling and routing problems such as Dial …

Scheduling problems have been studied for a long time in Constraint Programming (CP). As
the constraints used to model such scheduling problems are often NP-hard to filter, various …

Nous considérerons unprobì eme d'ordonnancement cumulatif dans lequel les tâches ont
une durée et un pro-fil de consommation de ressource variable. Ce profil, qui peut varier en …

Every Constraint Programming (CP) solver exposes a library of constraints for solving
combinatorial problems. In order to be useful, CP solvers need to be bug-free. Therefore the …