arxivcs.AI2026-07-06
CP-WSP: A Declarative CP-SAT Framework for Configurable Multi-Constraint Workforce Scheduling
Vipul Patel, Anirudh Deodhar, Dagnachew Birru
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 constrai…