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.
Type de document :
Communication dans un congrès
F. Calimeri and G. Ianni and M. Truszczyski. Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15), 2015, Lexington, United States. Springer, 9345, pp.7, 2015, lnai
Liste complète des métadonnées

https://hal.inria.fr/hal-01186995
Contributeur : René Quiniou <>
Soumis le : mardi 25 août 2015 - 18:25:15
Dernière modification le : vendredi 16 novembre 2018 - 01:39:32

Identifiants

  • HAL Id : hal-01186995, version 1

Citation

Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub, Stefan Woltran. Shift-design with Answer Set Programming. F. Calimeri and G. Ianni and M. Truszczyski. Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15), 2015, Lexington, United States. Springer, 9345, pp.7, 2015, lnai. 〈hal-01186995〉

Partager

Métriques

Consultations de la notice

959