Skip to main content

Operating Room Scheduling via Answer Set Programming

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11298))

Abstract

The Operating Room Scheduling (ORS) problem is the task of assigning patients to operating rooms, taking in account different specialties, the surgery and operating room shift durations and different priorities. Given that Answer Set Programming (ASP) has been recently employed for solving real-life scheduling and planning problems, in this paper we first present an off-line solution based on ASP for solving the ORS problem. Then, we present techniques for re-scheduling on-line in case the off-line schedule can not be fully applied. Results of an experimental analysis conducted on benchmarks with realistic sizes and parameters show that ASP is a suitable solving methodology also for the ORS problem.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Abedini, A., Ye, H., Li, W.: Operating room planning under surgery type and priority constraints. Proc. Manuf. 5, 15–25 (2016)

    Google Scholar 

  2. Abseher, M., Gebser, M., Musliu, N., Schaub, T., Woltran, S.: Shift design with answer set programming. Fundam. Inf. 147(1), 1–25 (2016)

    Article  MathSciNet  Google Scholar 

  3. Alviano, M., Dodaro, C.: Anytime answer set optimization via unsatisfiable core shrinking. TPLP 16(5–6), 533–551 (2016)

    MathSciNet  MATH  Google Scholar 

  4. Alviano, M., Dodaro, C., Maratea, M.: An advanced answer set programming encoding for nurse scheduling. In: Esposito, F., Basili, R., Ferilli, S., Lisi, F. (eds.) AI*IA 2017. LNCS, vol. 10640, pp. 468–482. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70169-1_35

    Chapter  Google Scholar 

  5. Aringhieri, R., Landa, P., Soriano, P., Tànfani, E., Testi, A.: A two level metaheuristic for the operating room scheduling and assignment problem. Comput. Oper. Res. 54, 21–34 (2015)

    Article  MathSciNet  Google Scholar 

  6. Balduccini, M., Gelfond, M., Watson, R., Nogueira, M.: The USA-advisor: a case study in answer set planning. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 439–442. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45402-0_39

    Chapter  Google Scholar 

  7. Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)

    Article  Google Scholar 

  8. Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845–860 (2000)

    Article  Google Scholar 

  9. Calimeri, F., et al.: ASP-Core-2 Input Language Format (2013). https://www.mat.unical.it/aspcomp2013/files/ASP-CORE-2.01c.pdf

  10. Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: Design and results of the fifth answer set programming competition. Artif. Intell. 231, 151–181 (2016)

    Article  MathSciNet  Google Scholar 

  11. Dodaro, C., Gasteiger, P., Leone, N., Musitsch, B., Ricca, F., Schekotihin, K.: Combining answer set programming and domain heuristics for solving hard industrial problems (application paper). TPLP 16(5–6), 653–669 (2016)

    MathSciNet  MATH  Google Scholar 

  12. Dodaro, C., Leone, N., Nardi, B., Ricca, F.: Allotment problem in travel industry: a solution based on ASP. In: ten Cate, B., Mileo, A. (eds.) RR 2015. LNCS, vol. 9209, pp. 77–92. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22002-4_7

    Chapter  Google Scholar 

  13. Dodaro, C., Maratea, M.: Nurse scheduling via answer set programming. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 301–307. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61660-5_27

    Chapter  MATH  Google Scholar 

  14. Erdem, E., Öztok, U.: Generating explanations for biomedical queries. TPLP 15(1), 35–78 (2015)

    MathSciNet  MATH  Google Scholar 

  15. Faber, W., Pfeifer, G., Leone, N.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278–298 (2011)

    Article  MathSciNet  Google Scholar 

  16. Gavanelli, M., Nonato, M., Peano, A.: An ASP approach for the valves positioning optimization in a water distribution system. J. Log. Comput. 25(6), 1351–1369 (2015)

    Article  MathSciNet  Google Scholar 

  17. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: ICLP (Technical Communications). OASICS, vol. 52, pp. 2:1–2:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)

    Google Scholar 

  18. Landa, P., Aringhieri, R., Soriano, P., Tànfani, E., Testi, A.: A hybrid optimization algorithm for surgeries scheduling. Oper. Res. Health Care 8, 103–114 (2016)

    Article  Google Scholar 

  19. Maratea, M., Pulina, L., Ricca, F.: A multi-engine approach to answer-set programming. TPLP 14(6), 841–868 (2014)

    MathSciNet  Google Scholar 

  20. Molina-Pariente, J.M., Hans, E.W., Framinan, J.M., Gomez-Cia, T.: New heuristics for planning operating rooms. Comput. Indus. Eng. 90, 429–443 (2015)

    Article  Google Scholar 

  21. 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. TPLP 12(3), 361–381 (2012)

    MathSciNet  MATH  Google Scholar 

  22. Shu, A.C., Subbaraj, I., Phan, L.: Operating Room Rescheduler (2015)

    Google Scholar 

  23. Zhang, J., Dridi, M., El Moudni, A.: A stochastic shortest-path MDP model with dead ends for operating rooms planning, pp. 1–6, September 2017

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marco Maratea .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dodaro, C., Galatà, G., Maratea, M., Porro, I. (2018). Operating Room Scheduling via Answer Set Programming. In: Ghidini, C., Magnini, B., Passerini, A., Traverso, P. (eds) AI*IA 2018 – Advances in Artificial Intelligence. AI*IA 2018. Lecture Notes in Computer Science(), vol 11298. Springer, Cham. https://doi.org/10.1007/978-3-030-03840-3_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-03840-3_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-03839-7

  • Online ISBN: 978-3-030-03840-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics