Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A Scalable Sweep Algorithm for the Cumulative Constraint
INRIA, France.
INRIA, France.
RISE., Swedish ICT, SICS, Computer Systems Laboratory.ORCID-id: 0000-0003-3079-8095
2012 (Engelska)Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

This paper presents a sweep based algorithm for the cumulative constraint, which can operate in filtering mode as well as in greedy assignment mode. Given n tasks, this algorithm has a worst-case time complexity of O(n 2). In practice, we use a variant with better average-case complexity but worst-case complexity of O(n 2 log n), which goes down to O(n log n) when all tasks have unit duration, i.e. in the bin-packing case. Despite its worst-case time complexity, this algorithm scales well in practice, even when a significant number of tasks can be scheduled in parallel. It handles up to 1 million tasks in one single cumulative constraint in both Choco and SICStus.

Ort, förlag, år, upplaga, sidor
Springer , 2012, 6. Vol. 7514, s. 439-454
Serie
Lecture Notes in Computer Science
Nyckelord [en]
Average-case complexity, Bin-packing, Sweep algorithms, Time complexity, Worst-case complexity
Nationell ämneskategori
Data- och informationsvetenskap
Identifikatorer
URN: urn:nbn:se:ri:diva-24091DOI: 10.1007/978-3-642-33558-7_33Scopus ID: 2-s2.0-84868285670ISBN: 9783642335570 (tryckt)OAI: oai:DiVA.org:ri-24091DiVA, id: diva2:1043170
Konferens
18th International Conference on Principles and Practice of Constraint Programming, CP 2012; Quebec City, QC; Canada; 8 October 2012 through 12 October 2012
Projekt
SICStus PrologTillgänglig från: 2016-10-31 Skapad: 2016-10-31 Senast uppdaterad: 2023-05-05Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopushttp://dx.doi.org/10.1007/978-3-642-33558-7_33

Person

Carlsson, Mats

Sök vidare i DiVA

Av författaren/redaktören
Carlsson, Mats
Av organisationen
Computer Systems Laboratory
Data- och informationsvetenskap

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 24 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf