A filtering algorithm for the stretch constraint

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2239, Issue , 2001, Pages 183-195

  Pesant, Gilles ^a,b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

FILTERING ALGORITHM; ROSTERING; TIME COMPLEXITY;

SIGNAL FILTERING AND PREDICTION;

EID: 84947917456     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_13     Document Type: Conference Paper

References (8)

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