Skip to Main content Skip to Navigation
New interface
Conference papers

Shift-design with Answer Set Programming

Abstract : Answer Set Programming (ASP) is a powerful declarative programming paradigm that has been successfully applied to many di erent 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 understang 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.
Complete list of metadata
Contributor : René Quiniou Connect in order to contact the contributor
Submitted on : Tuesday, August 25, 2015 - 6:25:15 PM
Last modification on : Tuesday, October 25, 2022 - 4:19:51 PM


  • HAL Id : hal-01186995, version 1


Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub, Stefan Woltran. Shift-design with Answer Set Programming. Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15), 2015, Lexington, United States. pp.7. ⟨hal-01186995⟩



Record views