{
  "abstract": "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2607.05177",
  "author_total": 3,
  "authors": [
    {
      "name": "Vipul Patel"
    },
    {
      "name": "Anirudh Deodhar"
    },
    {
      "name": "Dagnachew Birru"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/ebqkmt82r4hz9.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2607.05177",
  "fulltext_url": null,
  "id": "ebqkmt82r4hz9",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2607.05177",
  "language": null,
  "licence": "CC-BY-NC-ND-4.0",
  "licence_label": "CC BY-NC-ND 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.AI"
    ],
    [
      "arxiv",
      "math.OC"
    ],
    [
      "openalex",
      "1803|Scheduling and Timetabling Solutions"
    ]
  ],
  "openalex": "W7167607810",
  "pdf_url": "https://arxiv.org/pdf/2607.05177",
  "pmcid": null,
  "pmid": null,
  "published": "2026-07-06",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/ebqkmt82r4hz9.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:48Z",
      "native_id": "2607.05177",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2607.05177"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.OC",
      "subfield": "optimisation-control"
    }
  ],
  "title": "CP-WSP: A Declarative CP-SAT Framework for Configurable Multi-Constraint Workforce Scheduling",
  "title_text": "CP-WSP: A Declarative CP-SAT Framework for Configurable Multi-Constraint Workforce Scheduling",
  "type": "preprint",
  "updated_at": "2026-10-30T12:17:48Z",
  "url": "https://research.draconitic.com/paper/ebqkmt82r4hz9",
  "venue": "arXiv",
  "versions": []
}