Talks and Poster Presentations (with Proceedings-Entry):

M. Abseher, M. Gebser, N. Musliu, T. Schaub, S. Woltran:
"Shift Design with Answer Set Programming";
Talk: 8th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2015, Cork, Ireland; 2015-08-31; in: "8th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2015", D. Inclezan, M. Maratea (ed.); (2015), 13 pages.

English abstract:
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. 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 solving methods based on ASP.

Electronic version of the publication:

Related Projects:
Project Head Nysret Musliu:
Künstliche Intelligenz in der Personalplanung

Project Head Stefan Woltran:
Answer-Set Programming Erweiterungen für Problemlösungen auf Zerlegungen

Project Head Stefan Woltran:

Created from the Publication Database of the Vienna University of Technology.