Synchronized sweep algorithms for scalable scheduling constraints

Arnaud Letort 1, 2, 3 Mats Carlsson 4 Nicolas Beldiceanu 1
1 TASC - Theory, Algorithms and Systems for Constraints
Inria Rennes – Bretagne Atlantique , Département informatique - EMN, LINA - Laboratoire d'Informatique de Nantes Atlantique
Abstract : This paper introduces a family of synchronized sweep-based filtering algorithms for handling scheduling problems involving resource and precedence constraints. The key idea is to filter all constraints of a scheduling problem in a synchronized way in order to scale better. In addition to normal filtering mode, the algorithms can run in greedy mode, in which case they perform a greedy assignment of start and end times. The filtering mode achieves a significant speed-up over the decomposition into independent cumulative and precedence constraints, while the greedy mode can handle up to 1 million tasks with 64 resource constraints and 2 million precedences. These algorithms were implemented in both CHOCO and SICStus.
Type de document :
Article dans une revue
Constraints, Springer Verlag, 2014, pp.52. 〈10.1007/s10601-014-9172-8〉
Liste complète des métadonnées
Contributeur : Contraintes Lina <>
Soumis le : lundi 24 novembre 2014 - 18:19:36
Dernière modification le : vendredi 22 juin 2018 - 09:32:21



Arnaud Letort, Mats Carlsson, Nicolas Beldiceanu. Synchronized sweep algorithms for scalable scheduling constraints. Constraints, Springer Verlag, 2014, pp.52. 〈10.1007/s10601-014-9172-8〉. 〈hal-01086765〉



Consultations de la notice