PulseAugur
EN
LIVE 09:04:50

New CP-SAT framework tackles complex workforce scheduling challenges

Researchers have developed CP-WSP, a new declarative framework using CP-SAT to address complex workforce scheduling problems. This framework enforces 14 hard constraints and optimizes 15 soft objectives, offering greater configurability and handling more intricate scheduling scenarios than previous methods. It supports features like mandatory break scheduling, acuity-weighted workload equity, and multi-granularity temporal resolution, evaluated on INRC-II benchmarks and synthetic configurations. AI

IMPACT This framework could improve efficiency and fairness in complex scheduling operations across various industries.

RANK_REASON The cluster describes a new academic paper detailing a framework for a specific problem domain.

Read on arXiv cs.AI →

AI-generated summary · Google Gemini · from 2 sources. How we write summaries →

New CP-SAT framework tackles complex workforce scheduling challenges

COVERAGE [2]

  1. arXiv cs.AI TIER_1 English(EN) · Vipul Patel, Anirudh Deodhar, Dagnachew Birru ·

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

    arXiv:2607.05177v1 Announce Type: new 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 typical…

  2. arXiv cs.AI TIER_1 English(EN) · Dagnachew Birru ·

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

    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…