2026-07-30T23:59:12Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:20692 2024-08-29T08:52:52Z ddc:004 open_access

Cumulative Scheduling with Calendars and Overtime Cloutier, Samuel Quimper, Claude-Guy Constraint programming Scheduling Global constraints Calendars Overtime Cumulative constraint Time-Tabling In project scheduling, calendar considerations can increase the duration of a task when its execution overlaps with holidays. On the other hand, the use of overtime may decrease the task’s duration. We introduce the CalendarOvertime constraint which verifies that a task follows a calendar with overtime and holidays. We also introduce the CumulativeOvertime constraint, a variant of the Cumulative constraint, that also reasons with the calendars when propagating according to the resource consumption, the overtime, and the holidays. Experimental results of a RCPSP model on the PSPLIB, BL, and PACK instances augmented with calendars and overtime show that the use of the CalendarOvertime constraint offers a speedup greater than 2.9 on the instances optimally solved and finds better solutions on more than 79% of the remaining instances when compared to a decomposition of the constraint. We also show that the use of our CumulativeOvertime constraint further improves these results. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Samuel Cloutier and Claude-Guy Quimper 2024 Is Part Of LIPIcs, Volume 307, 30th International Conference on Principles and Practice of Constraint Programming (CP 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CP.2024.7 urn:nbn:de:0030-drops-206927 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.7 eng https://creativecommons.org/licenses/by/4.0/legalcode