60. A scheduling problem with restricted work/days-off periods
Invited abstract in session TE-2: Timetabling, stream Timetabling.
Thursday, 16:30 - 18:00Room: M228
Authors (first author is the speaker)
| 1. | Fabien Nießen
|
| KU Leuven | |
| 2. | Paul Paschmanns
|
| University Bonn |
Abstract
The field of nurse rostering is a broad topic and involves many problems differing in complexity and structure. An easy formulation is used in the Days-On-Days-Off Scheduling Problem, which includes few constraints on the length of consecutive working and off-day periods.
This problem was introduced in 2013 and claimed to be NP-hard.
We proved that the decision version of this problem is indeed strongly NP-complete and succeeded in developing some algorithms for polynomial time subproblems.
In this talk, we want to present the latest results and discuss the remaining open cases.
Keywords
- Scheduling
- Algorithm and Computational Design
Status: accepted
Back to the list of papers