[Back]

M. Abseher, M. Gebser, N. Musliu, T. Schaub, S. Woltran:
"Shift Design with Answer Set Programming";
Talk: 13th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 2015, Lexington, Kentucky, USA; 09-27-2015 - 09-30-2015; in: "Logic Programming and Nonmonotonic Reasoning, 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27-30, 2015, Proceedings", F. Calimeri, G. Ianni, M. Truszczynski (ed.); Springer, Lecture Notes in Computer Science Volume 9345 (2015), ISBN: 978-3-319-23263-8; 32 - 39.

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.

http://dx.doi.org/10.1007/978-3-319-23264-5_4

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:
START