Skip to Main content Skip to Navigation
Theses

Ordonnancement cumulatif avec dépassements de capacité : Contrainte globale et décompositions

Abstract : Constraint programming is an interesting approach to solve scheduling problems. In cumulative scheduling, activities are defined by their starting date, their duration and the amount of resource necessary for their execution. The total available resource at each point in time (the capacity) is fixed. In constraint programming, the Cumulative global constraint models this problem. In several practical cases, the deadline of theproject is fixed and can not be delayed. In this case, it is not always possible to find a schedule that does not lead to an overload of the resource capacity. It can be tolerated to relax the capacity constraint, in a reasonable limit, to obtain a solution. We propose a new global constraint : the SoftCumulative constraint that extends the Cumulative constraint to handle these overloads. We illustrate its modeling power on several practical problems, and we present various filtering algorithms. In particular, we adapt the sweep and Edge-Finding algorithms to the SoftCumulative constraint. We also show that some practical problems require to impose overloads to satisfy business rules, modelled by additional constraints. We present an original filtering procedure to deal with these imposed overloads. We complete our study by an approach by decomposition. At last, we test and validate our different resolution techniques through a series of experiments.
Document type :
Theses
Complete list of metadatas

Cited literature [111 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00794323
Contributor : Abes Star :  Contact
Submitted on : Monday, February 25, 2013 - 3:27:48 PM
Last modification on : Thursday, March 5, 2020 - 5:47:53 PM
Long-term archiving on: : Sunday, May 26, 2013 - 7:30:09 AM

File

DeClercq_A_10_2012.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00794323, version 1

Citation

Alexis de Clercq. Ordonnancement cumulatif avec dépassements de capacité : Contrainte globale et décompositions. Langage de programmation [cs.PL]. Ecole des Mines de Nantes, 2012. Français. ⟨NNT : 2012EMNA0057⟩. ⟨tel-00794323⟩

Share

Metrics

Record views

800

Files downloads

670