Change search
ReferencesLink to record
Permanent link

Direct link
Synchronized sweep algorithms for scalable scheduling constraints
SICSTUS.
RISE, Swedish ICT, SICS. Computer Systems Laboratory.
SICSTUS.
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.
Series
SICS Technical Report, ISSN 1100-3154 ; 2013:05
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-24190OAI: oai:DiVA.org:ri-24190DiVA: diva2:1043269
Projects
SICSTUS
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

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

By organisation
SICS
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2 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

Total: 6 hits
ReferencesLink to record
Permanent link

Direct link