כתבה
arXiv cs.AI ·
Implementing Cumulative Functions with Generalized Cumulative Constraints
תקציר מקורי באנגליתarXiv:2508.01751v3 Announce Type: replace Abstract: Modeling scheduling problems with conditional time intervals and cumulative functions has become a common approach when using modern commercial constraint programming solvers. This paradigm enables the modeling of a wide range of scheduling problems, including those involving producers and consumers. However, it is unavailable in existing open-source solvers and practical implementation details remain undocumented. In this work, we present an implementation of this modeling approach using a single, generic global constraint called the Generalized Cumulative. We also introduce a novel timetabling filtering algorithm specifically designed to handle tasks defined on conditional time-intervals. Experimental results demonstrate that this appro
קרא במקור המקורי
arxiv.org
פתח כתבה מקורית