{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:22:06Z","timestamp":1792070526771,"version":"4.4.0"},"reference-count":35,"publisher":"Oxford University Press (OUP)","issue":"8","license":[{"start":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T00:00:00Z","timestamp":1722211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,12,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The Operating Room Scheduling (ORS) problem deals with the optimization of daily operating room surgery schedules. It is a challenging problem subject to many constraints, like to determine the starting time of different surgeries and allocating the required resources, including the availability of beds in different units. In the past years, Answer Set Programming (ASP) has been successfully employed for addressing and solving the ORS problem. Despite its importance, due to the inherent difficulty of retrieving real data, all the analyses on ORS ASP encodings have been performed on synthetic data so far. In this paper, first we present a new, improved ASP encoding for the ORS problem. Then, we deal with the real case of ASL1 Liguria, an Italian health authority operating through three hospitals, and present adaptations of the ASP encodings to deal with the real-world data. Further, we analyse the resulting encodings on hospital scheduling data by ASL1 Liguria. Results on some scenarios show that the ASP solutions produce satisfying schedules also when applied to such challenging, real data.1<\/jats:p>","DOI":"10.1093\/logcom\/exae041","type":"journal-article","created":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T17:21:54Z","timestamp":1722360114000},"page":"1556-1579","source":"Crossref","is-referenced-by-count":7,"title":["Operating room scheduling via answer set programming: Improved encoding and test on real data"],"prefix":"10.1093","volume":"34","author":[{"given":"Carmine","family":"Dodaro","sequence":"first","affiliation":[{"name":"DeMaCS, University of Calabria , Rende, 87036 ,","place":["Italy"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe","family":"Galat\u00e0","sequence":"additional","affiliation":[{"name":"SurgiQ srl , Genova, 16100 ,","place":["Italy"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Gebser","sequence":"additional","affiliation":[{"name":"Department of Artificial Intelligence and Cybersecurity, University of Klagenfurt , Klagenfurt ,","place":["Austria"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[{"name":"DeMaCS, University of Calabria , Rende, 87036 ,","place":["Italy"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cinzia","family":"Marte","sequence":"additional","affiliation":[{"name":"DeMaCS, University of Calabria , Rende, 87036 ,","place":["Italy"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Mochi","sequence":"additional","affiliation":[{"name":"DIBRIS, University of Genoa , Genova, 16100 ,","place":["Italy"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Scanu","sequence":"additional","affiliation":[{"name":"SurgiQ srl , Genova, 16100 ,","place":["Italy"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2024,7,29]]},"reference":[{"key":"2024121019262525000_ref1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.promfg.2016.08.005","article-title":"Operating room planning under surgery type and priority constraints","volume":"5","author":"Abedini","year":"2016","journal-title":"Procedia Manufacturing"},{"key":"2024121019262525000_ref2","first-page":"241","article-title":"Evaluation of disjunctive programs in WASP","volume-title":"LPNMR","author":"Alviano","year":"2019"},{"key":"2024121019262525000_ref3","first-page":"241","article-title":"Evaluation of disjunctive programs in WASP","volume-title":"LPNMR 2019","author":"Alviano","year":"2019"},{"key":"2024121019262525000_ref4","article-title":"Answer set programming in healthcare: extended overview","volume-title":"IPS and RCRA 2020","author":"Alviano","year":"2020"},{"key":"2024121019262525000_ref5","first-page":"468","article-title":"An advanced answer set programming encoding for nurse scheduling","volume-title":"AI*IA","author":"Alviano","year":"2017"},{"key":"2024121019262525000_ref6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.3233\/IA-170030","article-title":"Nurse (re)scheduling via answer set programming","volume":"12","author":"Alviano","year":"2018","journal-title":"Intelligenza Artificiale"},{"key":"2024121019262525000_ref7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.cor.2014.08.014","article-title":"A two level metaheuristic for the operating room scheduling and assignment problem","volume":"54","author":"Aringhieri","year":"2015","journal-title":"Computers & Operations Research"},{"key":"2024121019262525000_ref8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","article-title":"Answer set programming at a glance","volume":"54","author":"Brewka","year":"2011","journal-title":"Communications of the ACM"},{"key":"2024121019262525000_ref9","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1109\/69.877512","article-title":"Enhancing disjunctive Datalog by constraints","volume":"12","author":"Buccafurri","year":"2000","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2024121019262525000_ref10","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1017\/S1471068419000450","article-title":"ASP-Core-2 input language format","volume":"20","author":"Calimeri","year":"2020","journal-title":"Theory and Practice of Logic Programming"},{"key":"2024121019262525000_ref11","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1017\/S147106842300025X","article-title":"Logic-based Benders decomposition in answer set programming for chronic outpatients scheduling","volume":"23","author":"Cappanera","year":"2023","journal-title":"Theory and Practice of Logic Programming"},{"key":"2024121019262525000_ref12","first-page":"111","article-title":"A two-phase ASP encoding for solving rehabilitation scheduling","volume-title":"Proceedings of the 5th International Joint Conference on Rules and Reasoning (RuleML+RR 2021)","author":"Cardellini","year":"2021"},{"key":"2024121019262525000_ref13","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1093\/logcom\/exad017","article-title":"Scheduling pre-operative assessment clinic with answer set programming","volume":"34","author":"Caruso","year":"2024","journal-title":"Journal of Logic and Computation"},{"key":"2024121019262525000_ref14","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1017\/S1471068421000363","article-title":"An ASP-based solution to the chemotherapy treatment scheduling problem","volume":"21","author":"Dodaro","year":"2021","journal-title":"Theory and Practice of Logic Programming"},{"key":"2024121019262525000_ref15","first-page":"67","article-title":"An ASP-based solution for operating room scheduling with beds management","volume-title":"Proceedings of the Third International Joint Conference on Rules and Reasoning (RuleML+RR 2019)","author":"Dodaro","year":"2019"},{"key":"2024121019262525000_ref16","first-page":"204","article-title":"Solving operating room scheduling problems with surgical teams via answer set programming","volume-title":"AIxIA 2020\u2014Advances in Artificial Intelligence\u2014Revised Selected Papers of the 19th International Conference of the Italian Association for Artificial Intelligence (AI*IA 2020)","author":"Dodaro","year":"2020"},{"key":"2024121019262525000_ref17","first-page":"445","article-title":"Operating room scheduling via answer set programming","volume-title":"AI*IA","author":"Dodaro","year":"2018"},{"key":"2024121019262525000_ref18","doi-asserted-by":"crossref","first-page":"63","DOI":"10.3233\/IA-190020","article-title":"An ASP-based framework for operating room scheduling","volume":"13","author":"Dodaro","year":"2019","journal-title":"Intelligenza Artificiale"},{"key":"2024121019262525000_ref19","first-page":"301","article-title":"Nurse scheduling via answer set programming","volume-title":"LPNMR","author":"Dodaro","year":"2017"},{"key":"2024121019262525000_ref20","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","article-title":"Semantics and complexity of recursive aggregates in answer set programming","volume":"175","author":"Faber","year":"2011","journal-title":"Artificial Intelligence"},{"key":"2024121019262525000_ref21","article-title":"An asp-based solution to the operating room scheduling with care units","volume-title":"Proceedings of the 9th Italian workshop on Planning and Scheduling (IPS\u201921) and the 28th International Workshop on \u201dExperimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion\u201d (RCRA\u201921) co-located with AIxIA 2021","author":"Galat\u00e0","year":"2021"},{"key":"2024121019262525000_ref22","first-page":"2:1","article-title":"Theory solving made easy with clingo 5","volume-title":"ICLP (Technical Communications)","author":"Gebser","year":"2016"},{"key":"2024121019262525000_ref23","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","article-title":"Conflict-driven answer set solving: from theory to practice","volume":"187\u2013188","author":"Gebser","year":"2012","journal-title":"Artificial Intelligence"},{"key":"2024121019262525000_ref24","first-page":"1070","article-title":"The stable model semantics for logic programming","volume-title":"Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15\u201319, 1988 (2 Volumes)","author":"Gelfond","year":"1988"},{"key":"2024121019262525000_ref25","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Computing"},{"key":"2024121019262525000_ref26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2018\/5341394","article-title":"Application of operational research techniques in operating room scheduling problems: literature overview","volume":"2018","author":"G\u00fcr","year":"2018","journal-title":"Journal of Healthcare Engineering"},{"key":"2024121019262525000_ref27","volume-title":"LLC: Gurobi Optimizer Reference Manual","author":"Gurobi Optimization","year":"2021"},{"key":"2024121019262525000_ref28","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.cor.2019.04.010","article-title":"Operating room scheduling by considering the decision-making styles of surgical team members: a comprehensive approach","volume":"108","author":"Hamid","year":"2019","journal-title":"Computers & Operation Research"},{"key":"2024121019262525000_ref29","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.orhc.2016.01.001","article-title":"A hybrid optimization algorithm for surgeries scheduling","volume":"8","author":"Landa","year":"2016","journal-title":"Operations Research for Health Care"},{"key":"2024121019262525000_ref30","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.jclinane.2010.02.003","article-title":"What does one minute of operating room time cost","volume":"22","author":"Macario","year":"2010","journal-title":"Journal of Clinical Anesthesia"},{"key":"2024121019262525000_ref31","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.dss.2012.10.019","article-title":"Multi-objective operating room scheduling considering desiderata of the surgical team","volume":"55","author":"Meskens","year":"2013","journal-title":"Decision Support Systems"},{"key":"2024121019262525000_ref32","volume-title":"Input\/Output Format and Solver Requirements for the Competitions of Pseudo-Boolean Solvers","author":"Roussel","year":"2012"},{"key":"2024121019262525000_ref33","article-title":"Operating room scheduling via answer set programming: the case of ASL1 Liguria","volume-title":"Proc. of the 38th Italian Conference on Computational Logic (CILC 2023)","author":"Scanu","year":"2023"},{"key":"2024121019262525000_ref34","doi-asserted-by":"crossref","first-page":"10","DOI":"10.55576\/job.v2i4.23","article-title":"Cost of or time is $46.04 per minute","volume":"2","author":"Smith","year":"2022","journal-title":"Journal of Orthopaedic Business"},{"key":"2024121019262525000_ref35","first-page":"1","article-title":"A stochastic shortest-path MDP model with dead ends for operating rooms planning","volume-title":"ICAC","author":"Zhang","year":"2017"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/34\/8\/1556\/60953004\/exae041.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/34\/8\/1556\/60953004\/exae041.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T20:22:27Z","timestamp":1733862147000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/34\/8\/1556\/7723280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,29]]},"references-count":35,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2024,7,29]]},"published-print":{"date-parts":[[2024,12,4]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exae041","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2024,12]]},"published":{"date-parts":[[2024,7,29]]}}}