View article

The Sequence constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the Sequence constraint, some of which do not hinder propagation. We prove that, down a branch of a search tree, domain consistency can be enforced on the Sequence constraint in just O(n ² logn) time. This improves upon the previous bound of O(n ³) for each call down the tree. We also consider a generalization of the Sequence constraint – the Multiple Sequence constraint. Our experiments suggest that, on very large and tight problems, domain consistency algorithms are best. However, on smaller or looser problems, much simpler encodings are better, even though these encodings hinder propagation. When there are multiple Sequence constraints, a more expensive propagator shows promise.