CP-WSP: A Declarative CP-SAT Framework for Configurable Multi-Constraint Workforce Scheduling
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 65 of its 92 references that are in the map. First posted on arXiv 6 Jul 2026.
Builds on
65 of 92 references.
References · 65
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,974
- 2020End-to-End Object Detection with Transformerscited by 7,414
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
- 2015Fast R-CNNcited by 2,933
- 2025DINOv3cited by 1,414
- 2022DINO: DETR with Improved DeNoising Anchor Boxes for End-to-End Object Detectioncited by 1,319
- 2025SAM 3: Segment Anything with Conceptscited by 906
- 2020Simple Copy-Paste is a Strong Data Augmentation Method for Instance Segmentationcited by 596
- 2023DETRs Beat YOLOs on Real-time Object Detectioncited by 533
- 2024YOLOv10: Real-Time End-to-End Object Detectioncited by 515
- 2024YOLOv9: Learning What You Want to Learn Using Programmable Gradient Informationcited by 425
38 more
- 2024YOLOv11: An Overview of the Key Architectural Enhancementscited by 425
- 2021Conditional DETR for Fast Training Convergencecited by 424
- 2019High Frequency Component Helps Explain the Generalization of Convolutional Neural Networkscited by 310
- 2022How Do Vision Transformers Work?cited by 307
- 2025YOLOv12: Attention-Centric Real-Time Object Detectorscited by 305
- 2019A Fourier Perspective on Model Robustness in Computer Visioncited by 288
- 2021Vision Transformers are Robust Learnerscited by 207
- 2020FcaNet: Frequency Channel Attention Networkscited by 179
- 2022Anti-Oversmoothing in Deep Vision Transformers via the Fourier Domain Analysis: From Theory to Practicecited by 136
- 2023Large Selective Kernel Network for Remote Sensing Object Detectioncited by 98
- 2024RT-DETRv2: Improved Baseline with Bag-of-Freebies for Real-Time Detection Transformercited by 91
- 2025YOLO26: Key Architectural Enhancements and Performance Benchmarking for Real-Time Object Detectioncited by 79
- 2025RF-DETR: Neural Architecture Search for Real-Time Detection Transformerscited by 75
- 2024D-FINE: Redefine Regression Task in DETRs as Fine-grained Distribution Refinementcited by 74
- 2021QueryDet: Cascaded Sparse Query for Accelerating High-Resolution Small Object Detectioncited by 70
- 2024DEIM: DETR with Improved Matching for Fast Convergencecited by 68
- 2025YOLOv13: Real-Time Object Detection with Hypergraph-Enhanced Adaptive Visual Perceptioncited by 58
- 2021Focal and Efficient IOU Loss for Accurate Bounding Box Regressioncited by 57
- 2022Detecting tiny objects in aerial images: A normalized Wasserstein distance and a new benchmarkcited by 56
- 2024Frequency-aware Feature Fusion for Dense Image Predictioncited by 48
- 2024Frequency-Spatial Entanglement Learning for Camouflaged Object Detectioncited by 46
- 2023Adaptive Frequency Filters As Efficient Global Token Mixerscited by 45
- 2024What is YOLOv5: A deep look into the internal features of the popular object detectorcited by 37
- 2023Lite DETR : An Interleaved Multi-Scale Encoder for Efficient DETRcited by 36
- 2024MS-DETR: Efficient DETR Training with Mixed Supervisioncited by 35
- 2024Frequency-Adaptive Dilated Convolution for Semantic Segmentationcited by 34
- 2024Pinwheel-shaped Convolution and Scale-based Dynamic Loss for Infrared Small Target Detectioncited by 34
- 2024RT-DETRv3: Real-time End-to-End Object Detection with Hierarchical Dense Positive Supervisioncited by 32
- 2023Wise-IoU: Bounding Box Regression Loss with Dynamic Focusing Mechanismcited by 30
- 2025Real-Time Object Detection Meets DINOv3cited by 27
- 2023FFT-based Dynamic Token Mixer for Visioncited by 22
- 2024HS-FPN: High Frequency and Spatial Perception FPN for Tiny Object Detectioncited by 22
- 2024Mamba YOLO: A Simple Baseline for Object Detection with State Space Modelcited by 19
- 2025Frequency Dynamic Convolution for Dense Image Predictioncited by 19
- 2021Alpha-IoU: A Family of Power Intersection over Union Losses for Bounding Box Regressioncited by 18
- 2025Noise Calibration and Spatial-Frequency Interactive Network for STEM Image Enhancementcited by 16
- 2021Beyond Self-Supervision: A Simple Yet Effective Network Distillation Alternative to Improve Backbonescited by 15
- 2025UAV-DETR: Efficient End-to-End Object Detection for Unmanned Aerial Vehicle Imagerycited by 15
50 most cited of 65 All 65 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.