TY  - JOUR
A1  - Abseher, Michael
A1  - Musliu, Nysret
A1  - Woltran, Stefan
A1  - Gebser, Martin
A1  - Schaub, Torsten H.
T1  - Shift Design with Answer Set Programming
JF  - Fundamenta informaticae
N2  - Answer Set Programming (ASP) is a powerful declarative programming paradigm that has been successfully applied to many different domains. Recently, ASP has also proved successful for hard optimization problems like course timetabling and travel allotment. In this paper, we approach another important task, namely, the shift design problem, aiming at an alignment of a minimum number of shifts in order to meet required numbers of employees (which typically vary for different time periods) in such a way that over- and understaffing is minimized. We provide an ASP encoding of the shift design problem, which, to the best of our knowledge, has not been addressed by ASP yet. Our experimental results demonstrate that ASP is capable of improving the best known solutions to some benchmark problems. Other instances remain challenging and make the shift design problem an interesting benchmark for ASP-based optimization methods.
Y1  - 2016
U6  - https://doi.org/10.3233/FI-2016-1396
SN  - 0169-2968
SN  - 1875-8681
VL  - 147
SP  - 1
EP  - 25
PB  - IOS Press
CY  - Amsterdam
ER  -