Synchronized sweep algorithms for scalable scheduling constraints

Letort, Arnaud (författare)

Beldiceanu, Nicolas (författare)

(creator_code:org_t)

Relaterad länk:: https://ri.diva-port... (primary) (Raw object); visa fler...; https://urn.kb.se/re...; visa färre...

Abstract Ämnesord

Stäng

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.

Av författaren/redakt...: Letort, Arnaud; Carlsson, Mats; Beldiceanu, Nico ...

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.