Metraipolis › archive › dc_a7863fdaeba1

CP-WSP: A Declarative CP-SAT Framework for Configurable Multi-Constraint Workforce Scheduling — arXiv:2607.05177

Source
arXiv (en)
Original
https://arxiv.org/abs/2607.05177
License (as archived)
CC0-1.0
Archived
2026-10-17T09:07:08.217Z
SHA-256 of the archived text
4fa1b473b43fd56091b3ff444baa4dee245e88d4ed825946735827da10b2a9bc
Stable URL of this page
https://metraipolis.com/documento/dc_a7863fdaeba1

How to cite

CP-WSP: A Declarative CP-SAT Framework for Configurable Multi-Constraint Workforce Scheduling — arXiv:2607.05177 — arXiv (en), https://arxiv.org/abs/2607.05177 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a7863fdaeba1 (Metraipolis archive dc_a7863fdaeba1, sha256 4fa1b473b43fd56091b3ff444baa4dee245e88d4ed825946735827da10b2a9bc)
BibTeX
@misc{dca7863fdaeba1,
  title = {CP-WSP: A Declarative CP-SAT Framework for Configurable Multi-Constraint Workforce Scheduling — arXiv:2607.05177},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2607.05177},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a7863fdaeba1; sha256 4fa1b473b43fd56091b3ff444baa4dee245e88d4ed825946735827da10b2a9bc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2607.05177. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Workforce scheduling is an NP-hard combinatorial optimization problem requiring simultaneous satisfaction of labor regulations, coverage requirements, employee preferences and operational objectives. Existing CP formulations typically model simplified instances with 6-12 constraints at shift-level granularity and critically lack explicit support for: mandatory break scheduling with midpoint placement control; acuity weighted workload equity; sub-shift temporal granularity enabling demand-driven staffing; inter-week schedule stability; and cross-midnight shift patterns common in 24-hour operations. This paper presents CP-WSP: a declarative CP-SAT framework enforcing 14 hard constraints as mathematically inviolable requirements (zero regulatory violations by construction) while optimizing 15 soft objectives through a unified weighted penalty function -- all configurable via a JSON specification with no code changes required. Key contributions include: a shift-window variable decomposition enabling mandatory break scheduling with centrality control; acuity-weighted workload equity; multi-granularity temporal resolution from 30 minutes to 2 hours; inter-week schedule stability; a grid-offset preprocessing technique for cross-midnight shifts; and a reproducible 36-configuration benchmark suite for community comparison. Evaluated on INRC-II benchmarks at both hourly and shift-level granularity and on 36 synthetic configurations.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.OC).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2607.05177 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T08:40:19.779Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).