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 worstcase timeâ€¦ (More)

This paper presents a sweep based algorithm for the kdimensional cumulative constraint, which can operate in filtering mode as well as in greedy assignment mode. Given n tasks and k resources, thisâ€¦ (More)

This paper 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â€¦ (More)

This paper presents a new sweep based algorithm for the cumulative constraint that combines filtering with a greedy mode. The algorithm has a worst case complexity of O(n log n) in the context ofâ€¦ (More)