SODA

Sweep synchronisation as a global propagation mechanism

Beldiceanu, Nicolas and Carlsson, Mats and Thiel, Sven (2006) Sweep synchronisation as a global propagation mechanism. Computers & Operations Research, 3 (10). pp. 2835-2851.

Full text not available from this repository.

Abstract

This paper presents a new generic filtering algorithm that simultaneously considers n conjunctions of constraints as well as those constraints mentioning some variables Y_k of the pairs (X,Y_k) (1 <= k <= n) occurring in these conjunctions. The main benefit of this new technique comes from the fact that, for adjusting the bounds of a variable X according to n conjunctions, we do not perform n sweeps in an independent way but rather synchronize them. We then specialize this technique to the non-overlapping rectangles constraint where we consider the case where several rectangles of height one have the same X coordinate for their origin as well as the same length. For this specific constraint we come up with an incremental bipartite matching algorithm which is triggered while we sweep over the time axis. We illustrate the usefulness of this new pruning method on a timetabling problem, where each task can’t be interrupted and requires the simultaneous availability of n distinct persons. Each person has his own periods of unavailability and can only perform one task at a time.

Item Type:Article
ID Code:204
Deposited By:ISL Researcher
Deposited On:24 Apr 2008
Last Modified:18 Nov 2009 15:54

Repository Staff Only: item control page