Skip to Main content Skip to Navigation
New interface

Passage à l'échelle pour les contraintes d'ordonnancement multi-ressources

Arnaud Letort 1, 2 
2 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : Constraint programming is an approach often used to solve combinatorial problems in different application areas. In this thesis we focus on the cumulative scheduling problems. A scheduling problem is to determine the starting dates of a set of tasks while respecting capacity and precedence constraints. Capacity constraints affect both conventional cumulative constraints where the sum of the heights of tasks intersecting a given time point is limited, and colored cumulative constraints where the number of distinct colors assigned to the tasks intersecting a given time point is limited. A newly identified challenge for constraint programming is to deal with large problems, usually solved by dedicated algorithms and metaheuristics. For example, the increasing use of virtualized datacenters leads to multi dimensional placement problems of thousand of jobs. Scalability is achieved by using a synchronized sweep algorithm over the different cumulative and precedence constraints that allows to speed up convergence to the fix point. In addition, from these filtering algorithms we derive greedy procedures that can be called at each node of the search tree to find a solution more quickly. This approach allows to deal with scheduling problems involving more than one million jobs and 64 cumulative resources. These algorithms have been implemented within Choco and SICStussolvers and evaluated on a variety of placement and scheduling problems.
Complete list of metadata

Cited literature [76 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Thursday, January 16, 2014 - 3:07:14 PM
Last modification on : Wednesday, April 27, 2022 - 3:44:03 AM
Long-term archiving on: : Thursday, April 17, 2014 - 7:32:13 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00932215, version 1


Arnaud Letort. Passage à l'échelle pour les contraintes d'ordonnancement multi-ressources. Algorithme et structure de données [cs.DS]. Ecole des Mines de Nantes, 2013. Français. ⟨NNT : 2013EMNA0113⟩. ⟨tel-00932215⟩



Record views


Files downloads