International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR 2015: Logic Programming and Nonmonotonic Reasoning pp 32-39 | Cite as

Shift Design with Answer Set Programming

  • Michael Abseher
  • Martin Gebser
  • Nysret Musliu
  • Torsten Schaub
  • Stefan Woltran
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9345)

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.

References

  1. 1.
    Abseher, M.: Solving shift design problems with answer set programming. Master’s thesis, Technische Universität Wien (2013)Google Scholar
  2. 2.
    Banbara, M., Soh, T., Tamura, N., Inoue, K., Schaub, T.: Answer set programming as a modeling language for course timetabling. Theor. Pract. Logic Program. 13(4–5), 783–798 (2013)MATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    den Bergh, J., Beliën, J., Bruecker, P., Demeulemeester, E., Boeck, L.: Personnel scheduling: a literature review. Eur. J. Oper. Res. 226(3), 367–385 (2013)MATHCrossRefGoogle Scholar
  4. 4.
    Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)CrossRefGoogle Scholar
  5. 5.
    Crawford, J., Baker, A.: Experimental results on the application of satisfiability algorithms to scheduling problems. In: Proceedings of AAAI 1994, pp. 1092–1097. AAAI Press (1994)Google Scholar
  6. 6.
    Di Gaspero, L., Gärtner, J., Kortsarz, G., Musliu, N., Schaerf, A., Slany, W.: The minimum shift design problem. Ann. Oper. Res. 155, 79–105 (2007)MATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., Slany, W.: Automated shift design and break scheduling. In: Uyar, A.S., Ozcan, E., Urquhart, N. (eds.) Automated Scheduling and Planning. SCI, vol. 505, pp. 109–127. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  8. 8.
    Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Morgan & Claypool Publishers, San Rafael (2012)Google Scholar
  9. 9.
    Guziolowski, C., Videla, S., Eduati, F., Thiele, S., Cokelaer, T., Siegel, A., Saez-Rodriguez, J.: Exhaustively characterizing feasible logic models of a signaling network using answer set programming. Bioinformatics 29(18), 2320–2326 (2014)CrossRefGoogle Scholar
  10. 10.
    Musliu, N., Schaerf, A., Slany, W.: Local search for shift design. Eur. J. Oper. Res. 153(1), 51–64 (2004)MATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-prolog decision support system for the space shuttle. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 169–183. Springer, Heidelberg (2001) CrossRefGoogle Scholar
  12. 12.
    Ricca, F., Grasso, G., Alviano, M., Manna, M., Lio, V., Iiritano, S., Leone, N.: Team-building with answer set programming in the Gioia-Tauro seaport. Theor. Pract. Logic Program. 12(3), 361–381 (2012)MATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    Soininen, T., Niemelä, I.: Developing a declarative rule language for applications in product configuration. In: Gupta, G. (ed.) PADL 1999. LNCS, vol. 1551, pp. 305–319. Springer, Heidelberg (1999) CrossRefGoogle Scholar
  14. 14.
    Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints 14(2), 254–272 (2009)MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Michael Abseher
    • 1
  • Martin Gebser
    • 2
    • 3
  • Nysret Musliu
    • 1
  • Torsten Schaub
    • 3
    • 4
  • Stefan Woltran
    • 1
  1. 1.TU WienViennaAustria
  2. 2.Aalto University, HIITEspooFinland
  3. 3.University of PotsdamPotsdamGermany
  4. 4.INRIA RennesRennesFrance

Personalised recommendations