Change search
ReferencesLink to record
Permanent link

Direct link
Synchronized sweep algorithms for scalable scheduling constraints
RISE, Swedish ICT, SICS, Computer Systems Laboratory. SICS.
Number of Authors: 3
2013 (English)Report (Other academic)
Abstract [en]

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.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2013, 7.
SICS Technical Report, ISSN 1100-3154 ; 2013:05
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-15377OAI: diva2:1036694
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(503 kB)4 downloads
File information
File name FULLTEXT01.pdfFile size 503 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Computer Systems Laboratory
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 4 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link