2,915 research outputs found
Dagstuhl Reports : Volume 1, Issue 2, February 2011
Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro Pezzé, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn
Synchronized sweep algorithms for scalable scheduling constraints
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
- …