Implementing Cumulative Functions with Generalized Cumulative Constraints

Pierre Schaus, Charles Thomas, Roger Kameugne
8/3/2025
cs.AI

No confident code implementation found for this paper.

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 time-table filtering algorithm specifically designed to handle tasks defined on conditional time-intervals. Experimental results demonstrate that this approach, combined with the new filtering algorithm, performs competitively with existing solvers enabling the modeling of producer and consumer scheduling problems and effectively scales to large-scale problems.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{schaus2025implementing,
  title  = {Implementing Cumulative Functions with Generalized Cumulative Constraints},
  author = {Pierre Schaus and Charles Thomas and Roger Kameugne},
  year   = {2025},
  eprint = {2508.01751},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.01751v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.01751.svg)](https://codeofpaper.com/paper/2508.01751)

Discussion