1. |
- Letort, Arnaud, et al.
(författare)
-
A Synchronized Sweep Algorithm for the k-Dimensional Cumulative Constraint
- 2013. - 9
-
Ingår i: CPAIOR. - Berlin, Heidelberg : Springer. ; , s. 144-159
-
Konferensbidrag (refereegranskat)abstract
- This paper presents a sweep based algorithm for the k-dimensional Cumulative constraint, which can operate in filtering mode as well as in greedy assignment mode. Given n tasks and k resources, this algorithm has a worst-case time complexity of O(kn^2) but scales well in practice. In greedy assignment mode, it handles up to 1 million tasks with 64 resources in one single constraint in SICStus. In filtering mode, on our benchmarks, it yields a speed-up of about k^(3/4) when compared to its decomposition into k independent Cumulative constraints.
|
|