2264. Solving the Rotating Workforce Scheduling Problem With Global Constraints
Invited abstract in session TD-3: Workforce Scheduling and Routing, stream Project Management and Scheduling.
Thursday, 14:30-16:00Room: H5
Authors (first author is the speaker)
| 1. | Tristan Becker
|
| TU Dresden |
Abstract
The Rotating Workforce Scheduling Problem (RWSP) is a central planning task in many industries, aiming to generate work schedules that repeat over a defined cycle while ensuring efficient staff deployment and providing employees with consistent work assignments. While compact formulations have proven highly effective for the RWSP, their inherent structure, which avoids an exhaustive representation of days, presents a significant challenge in modeling global constraints. These constraints apply to extended periods of the schedule and are highly relevant in real-world workforce scheduling. They ensure, e.g., a minimum number of free weekends within a multi-week window or a maximum number of specific duties across several weeks. Addressing this gap, we propose a new mathematical model that integrates various global constraints into a compact RWSP representation by augmenting a global constraint graph. Our computational experiments evaluate the performance of our compact modeling framework with global constraints against non-compact mathematical programming models. The results indicate that our compact modeling framework is able to account for complex global constraints while preserving the computational efficiency and inherent benefits of compact RWSP models. Furthermore, our compact model with global constraints greatly outperforms non-compact models, allowing for an efficient resolution of the RWSP with global constraints.
Keywords
- Scheduling
- Human Resources Management
- Integer Programming
Status: accepted
Back to the list of papers