Synchronized sweep algorithms for scalable scheduling constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Constraints Year : 2014

Synchronized sweep algorithms for scalable scheduling constraints

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.

Dates and versions

hal-01086765 , version 1 (24-11-2014)

Identifiers

Cite

Arnaud Letort, Mats Carlsson, Nicolas Beldiceanu. Synchronized sweep algorithms for scalable scheduling constraints. Constraints, 2014, pp.52. ⟨10.1007/s10601-014-9172-8⟩. ⟨hal-01086765⟩
229 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More