Skip to Main content Skip to Navigation
Theses

Sur le tri de tâches pour résoudre des problèmes d'ordonnancement avec la programmation par contraintes

Abstract : During the last two decades, Constraint Programming gets very good results to solve scheduling problems. Thanks to the great expressivity of the paradigm, different algorithms and solving techniques from other fields within Combinatorial Optimisation have been integrated into constraint solvers. However this great expressivity comes with a price: constraint solvers are not the black box one might think of and require expertise to be correctly configured to efficiently solve problems. In this thesis, we explore the introduction and the use of list ordering algorithms into Constraint Programming to solve scheduling problems. We also revisit the AllDiffPrec constraint, defined as an Alldifferent constraint with precedence between some variables, for which we propose a new filtering algorithm.
Document type :
Theses
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-03681868
Contributor : ABES STAR :  Contact
Submitted on : Monday, May 30, 2022 - 3:43:29 PM
Last modification on : Wednesday, June 1, 2022 - 3:19:46 AM

File

2021IMTA0257_Godet-Arthur.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-03681868, version 1

Citation

Arthur Godet. Sur le tri de tâches pour résoudre des problèmes d'ordonnancement avec la programmation par contraintes. Discrete Mathematics [cs.DM]. Ecole nationale supérieure Mines-Télécom Atlantique, 2021. English. ⟨NNT : 2021IMTA0257⟩. ⟨tel-03681868⟩

Share

Metrics

Record views

0

Files downloads

0