Advertisement

A Filtering Algorithm for the Stretch Constraint

  • Gilles Pesant
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)

Abstract

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.

Keywords

Global Constraint Filter Algorithm Shift Variable Shift Type Cyclic Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    N. Balakrishnan and R.T. Wong. A Network Model for the Rotating Workforce Scheduling Problem. Networks, 20:25–42, 1990.CrossRefMathSciNetGoogle Scholar
  2. 2.
    N. Beldiceanu and E. Contejean. Introducing Global Constraints in CHIP. Mathematical and Computer Modelling, 20:97–123, 1994.zbMATHCrossRefGoogle Scholar
  3. 3.
    R. Hung. A Multiple-Shift Workforce Scheduling Model under the 4-Day Workweek with Weekday and Weekend Labour Demands. Journal of the Operational Research Society, 45:1088–1092, 1994.zbMATHCrossRefGoogle Scholar
  4. 4.
    G. Laporte. The Art and Science of Designing Rotating Schedules. Journal of the Operational Research Society, 50:1011–1017, 1999.zbMATHCrossRefGoogle Scholar
  5. 5.
    G. Laporte and G. Pesant. A General Multi-Shift Scheduling System. Working paper, 2001.Google Scholar
  6. 6.
    H.C. Lau. Combinatorial Approaches for Hard Problems in Manpower Scheduling. Journal of the Operations Research Society of Japan, 39:88–98, 1996.zbMATHMathSciNetGoogle Scholar
  7. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Gilles Pesant
    • 1
  1. 1.Centre for Research on TransportationUniversité de MontréalMontrealCanada

Personalised recommendations