Abstract
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consistency propagation of the stretch constraint. Using benchmark and random instances, we show that this stronger consistency sometimes enables our propagator to solve more difficult problems than a previously proposed propagation algorithm for the stretch constraint. We also discuss variations of the stretch constraint that seem simple and useful, but turn out to be intractable to fully propagate.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beldiceanu, N.: Pruning for the cardinality-path constraint family. Technical Report T2001/11A, SICS (2001)
Bessière, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of global constraints. In: Proceedings of the Nineteenth National Conference on Artificial Intelligence, San Jose, California (2004)
ILOG S. A. ILOG Solver 4.2 user’s manual (1998)
Laporte, G., Pesant, G.: A general multi-shift scheduling system. J. of the Operational Research Society (2004) (accepted for publication)
Pesant, G.: A filtering algorithm for the stretch constraint. In: Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming, Paphos, Cyprus, pp. 183–195 (2001)
Régin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, Portland, Oregon, pp. 209–215 (1996)
Régin, J.-C., Puget, J.-F.: A filtering algorithm for global sequencing constraints. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 32–46. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hellsten, L., Pesant, G., van Beek, P. (2004). A Domain Consistency Algorithm for the Stretch Constraint. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive