Synchronized sweep algorithms for scalable scheduling constraints

Arnaud Letort 1 Mats Carlsson 2 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 report 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 resources constraints and 2 million precedences. These algorithms were implemented in both CHOCO and SICStus.
Complete list of metadatas

https://hal.inria.fr/hal-00874331
Contributor : Contraintes Lina <>
Submitted on : Thursday, October 17, 2013 - 3:36:04 PM
Last modification on : Friday, June 22, 2018 - 9:32:23 AM

Identifiers

  • HAL Id : hal-00874331, version 1

Citation

Arnaud Letort, Mats Carlsson, Nicolas Beldiceanu. Synchronized sweep algorithms for scalable scheduling constraints. [Research Report] 2013, pp.49. ⟨hal-00874331⟩

Share

Metrics

Record views

395