A Filtering Algorithm for the Stretch Constraint
This paper describes a filtering algorithm for a type of constraint that often arises in rostering problems but that also has wider application. Defined on a sequence of variables, the stretch constraint restricts the number of consecutive identical values in the sequence. The algorithm mainly proceeds by determining intervals in which a given stretch must lie and then reasoning about them to filter out values. It is shown to have low time complexity and significant pruning capability as evidenced by experimental results.
KeywordsGlobal Constraint Filter Algorithm Shift Variable Shift Type Cyclic Schedule
Unable to display preview. Download preview PDF.
- 5.G. Laporte and G. Pesant. A General Multi-Shift Scheduling System. Working paper, 2001.Google Scholar
- 7.J.-C. Régin. A Filtering Algorithm for Constraints of Difference in CSPs. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), pages 362–367, 1994.Google Scholar
- 8.J.-C. Régin and J.-F. Puget. A Filtering Algorithm for Global Sequencing Constraints. In Principles and Practice of Constraint Programming-CP97: Proceedings of the Third International Conference, pages 32–46. Springer-Verlag LNCS 1330, 1997.Google Scholar