Constraint programming can be used to solve small tournament scheduling problems to
optimality. Beyonds its low size limits, local search techniques have been shown to yield
close-to-optimal schedules, when augmented with simulated annealing, reheating, strategic
oscillation and other techniques. In these approaches, the local moves are relatively small,
making the moves fast, but requiring sophisticated mechanisms to escape local minima. This
paper explores the possibility of making use of constraint programming as a technique for …