{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T06:03:04Z","timestamp":1769580184934,"version":"3.49.0"},"reference-count":57,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T00:00:00Z","timestamp":1769472000000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The Nuclear Medicine Scheduling (NMS) problem consists of assigning patients to a day, on which the patient will undergo the medical check, the preparation and the actual image detection process. The schedule should consider the different requirements of the patients and the available resources, e.g. varying time required for different diseases and radiopharmaceuticals used, number of injection chairs and tomographs available. In this paper, we present two solutions to the NMS problem based on Answer Set Programming (ASP). The first solution is a direct ASP encoding, which is then processed by an ASP solver, while the second solution employs a Logic-based Bender Decomposition (LBBD) approach implemented through the usage of multi-shot solving. Experiments employing real data show that the direct encoding provides overall satisfying results in terms of solutions quality in a relatively short time, and that the LBBD approach also helps in improving scalability.<\/jats:p>","DOI":"10.1093\/logcom\/exaf071","type":"journal-article","created":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T12:58:04Z","timestamp":1762865884000},"source":"Crossref","is-referenced-by-count":0,"title":["ASP-based approaches for solving the nuclear medicine scheduling problem"],"prefix":"10.1093","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-5286","authenticated-orcid":false,"given":"Carmine","family":"Dodaro","sequence":"first","affiliation":[{"name":"DeMaCS, University of Calabria , 87036, Rende ,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1948-4469","authenticated-orcid":false,"given":"Giuseppe","family":"Galat\u00e0","sequence":"additional","affiliation":[{"name":"SurgiQ srl , 16121, Genova ,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9034-2527","authenticated-orcid":false,"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[{"name":"DeMaCS, University of Calabria , 87036, Rende ,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3920-8186","authenticated-orcid":false,"given":"Cinzia","family":"Marte","sequence":"additional","affiliation":[{"name":"DeMaCS, University of Calabria , 87036, Rende ,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5849-3667","authenticated-orcid":false,"given":"Marco","family":"Mochi","sequence":"additional","affiliation":[{"name":"DIBRIS, University of Genoa , 16145, Genova ,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2026,1,27]]},"reference":[{"key":"2026012711402433100_ref1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-030-20528-7_1","article-title":"Train scheduling with hybrid asp","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Abels","year":"2019"},{"key":"2026012711402433100_ref2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.cor.2016.09.015","article-title":"A novel approach to determine a tactical and operational decision for dynamic appointment scheduling at nuclear medical center","volume":"78","author":"Akhavizadegan","year":"2017","journal-title":"Computers & Operations Research"},{"key":"2026012711402433100_ref3","doi-asserted-by":"crossref","first-page":"19816","DOI":"10.1038\/s41598-021-98851-7","article-title":"Optimization of an appointment scheduling problem for healthcare systems based on the quality of fairness service using whale optimization algorithm and NSGA-II","volume":"11","author":"Ala","year":"2021","journal-title":"Scientific Reports"},{"key":"2026012711402433100_ref4","doi-asserted-by":"crossref","first-page":"117949","DOI":"10.1016\/j.eswa.2022.117949","article-title":"Appointment scheduling problem under fairness policy in healthcare services: fuzzy ant lion optimizer","volume":"207","author":"Ala","year":"2022","journal-title":"Expert Systems with Applications"},{"key":"2026012711402433100_ref5","first-page":"pp. 468","article-title":"An advanced answer set programming encoding for nurse scheduling","volume":"10640","author":"Alviano","year":"2017","journal-title":"AIIA. LNCS"},{"key":"2026012711402433100_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":"2026012711402433100_ref7","first-page":"241","article-title":"Evaluation of disjunctive programs in WASP","volume-title":"LPNMR. LNCS","author":"Alviano","year":"2019"},{"key":"2026012711402433100_ref8","article-title":"Answer set programming in healthcare: extended overview","volume-title":"IPS and RCRA 2020. CEUR Workshop Proceedings","author":"Alviano","year":"2020"},{"key":"2026012711402433100_ref9","author":"Ans\u00f3tegui"},{"key":"2026012711402433100_ref10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.entcs.2004.06.065","article-title":"TSAT++: an open platform for satisfiability modulo theories","volume":"125","author":"Armando","year":"2005","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"2026012711402433100_ref11","first-page":"284","article-title":"Industrial-size scheduling with ASP+CP","volume-title":"Proc. of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNRM 2011). Lecture Notes in Computer Science","author":"Balduccini","year":"2011"},{"key":"2026012711402433100_ref12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10287-004-0020-y","article-title":"Partitioning procedures for solving mixed-variables programming problems","volume":"2","author":"Benders","year":"2005","journal-title":"Computational Management Science"},{"key":"2026012711402433100_ref13","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":"2026012711402433100_ref14","first-page":"95","article-title":"Combining deep learning and asp-based models for the semantic segmentation of medical images","volume-title":"Proceedings of the 5th International Joint Conference on Rules and Reasoning (RuleML+RR 2021). Lecture Notes in Computer Science","author":"Bruno","year":"2021"},{"key":"2026012711402433100_ref15","first-page":"505","article-title":"Dedudeep: an extensible framework for combining deep learning and ASP-based models","volume-title":"Proceedings of the 16th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2022). Lecture Notes in Computer Science","author":"Bruno","year":"2022"},{"key":"2026012711402433100_ref16","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":"2026012711402433100_ref17","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":"2026012711402433100_ref18","doi-asserted-by":"publisher","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":"2026012711402433100_ref19","doi-asserted-by":"publisher","article-title":"Fairness-driven mid-term scheduling of medical staff at a hospital network","author":"Cappanera","DOI":"10.13140\/RG.2.2.19565.36326"},{"key":"2026012711402433100_ref20","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). Lecture Notes in Computer Science","author":"Cardellini","year":"2021."},{"key":"2026012711402433100_ref21","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1093\/logcom\/exad017","article-title":"Scheduling pre-operative assessment clinic with answer set programming","volume":"34","author":"Caruso","year":"2023","journal-title":"Journal of Logic and Computation"},{"key":"2026012711402433100_ref22","article-title":"A heuristic logic-based benders method for the home health care problem","author":"Cir\u00e9","year":"2012","journal-title":"Manuscript, presented at Matheuristics"},{"key":"2026012711402433100_ref23","first-page":"301","article-title":"Nurse scheduling via answer set programming","volume-title":"LPNMR. LNCS","author":"Dodaro","year":"2017"},{"key":"2026012711402433100_ref24","first-page":"445","article-title":"Operating room scheduling via answer set programming","volume":"11298","author":"Dodaro","year":"2018","journal-title":"In: AIIA. LNCS"},{"key":"2026012711402433100_ref25","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). Lecture Notes in Computer Science","author":"Dodaro","year":"2019."},{"key":"2026012711402433100_ref26","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":"2026012711402433100_ref27","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":"2026012711402433100_ref28","article-title":"Nuclear medicine scheduling via answer set programming","volume-title":"Proceedings of the 39th Italian Conference on Computational Logic (CILC 2024). CEUR Workshop Proceedings","author":"Dodaro","year":"2024"},{"key":"2026012711402433100_ref29","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1017\/S1471068422000217","article-title":"Problem decomposition and multi-shot ASP solving for job-shop scheduling","volume":"22","author":"El-Kholany","year":"2022","journal-title":"Theory and Practice of Logic Programming"},{"key":"2026012711402433100_ref30","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1609\/aimag.v37i3.2678","article-title":"Applications of answer set programming","volume":"37","author":"Erdem","year":"2016","journal-title":"AI Magazine"},{"key":"2026012711402433100_ref31","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":"2026012711402433100_ref32","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s13218-018-0548-6","article-title":"Industrial applications of answer set programming","volume":"32","author":"Falkner","year":"2018","journal-title":"K\u00fcnstliche Intelligenz"},{"key":"2026012711402433100_ref33","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3390\/sci6010003","article-title":"Fairness and bias in artificial intelligence: a brief survey of sources, impacts, and mitigation strategies","volume":"6","author":"Ferrara","year":"2023","journal-title":"Sci"},{"key":"2026012711402433100_ref34","article-title":"Theory solving made easy with clingo 5","volume-title":"ICLP (Technical Communications). OASICS","author":"Gebser","year":"2016"},{"key":"2026012711402433100_ref35","first-page":"5450","article-title":"Evaluation techniques and systems for answer set programming: a survey","volume-title":"IJCAI","author":"Gebser","year":"2018."},{"key":"2026012711402433100_ref36","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1017\/S1471068418000182","article-title":"Routing driverless transport vehicles in car assembly with answer set programming","volume":"18","author":"Gebser","year":"2018","journal-title":"Theory and Practice of Logic Programming"},{"key":"2026012711402433100_ref37","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1017\/S1471068418000054","article-title":"Multi-shot ASP solving with clingo","volume":"19","author":"Gebser","year":"2019","journal-title":"Theory and Practice of Logic Programming"},{"key":"2026012711402433100_ref38","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":"2026012711402433100_ref39","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","article-title":"Generalized benders decomposition","volume":"10","author":"Geoffrion","year":"1972","journal-title":"Journal of Optimization Theory and Applications"},{"key":"2026012711402433100_ref40","first-page":"1551","article-title":"Logic-based benders decomposition and binary decision diagram based approaches for stochastic distributed operating room scheduling","volume":"33","author":"Guo","year":"2021","journal-title":"INFORMS Journal on Computing"},{"key":"2026012711402433100_ref41","volume-title":"Gurobi Optimizer Reference Manual","author":"Gurobi Optimization","year":"2021"},{"key":"2026012711402433100_ref42","first-page":"187","article-title":"Scheduling home hospice care with logic-based benders decomposition","volume-title":"In: Integration of AI and OR Techniques in Constraint Programming: 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29\u2013June 1, 2016, Proceedings 13","author":"Heching","year":"2016."},{"key":"2026012711402433100_ref43","first-page":"305","article-title":"A hybrid method for planning and scheduling","volume-title":"International Conference on Principles and Practice of Constraint Programming","author":"Hooker","year":"2004"},{"key":"2026012711402433100_ref44","volume-title":"Logic-Based Benders Decomposition: Theory and Applications","author":"Hooker","year":"2023"},{"key":"2026012711402433100_ref45","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","article-title":"Logic-based benders decomposition","volume":"96","author":"Hooker","year":"2003","journal-title":"Mathematical Programming"},{"key":"2026012711402433100_ref46","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-09284-3_33","article-title":"Open-WBO: a modular maxsat solver","volume-title":"Sat 2014. LNCS","author":"Martins","year":"2014"},{"key":"2026012711402433100_ref47","doi-asserted-by":"crossref","first-page":"01","DOI":"10.1109\/WCNC57260.2024.10571017","article-title":"Machine learning-driven patient scheduling in healthcare: a fairness-centric approach for optimized resource allocation","volume-title":"2024 IEEE Wireless Communications and Networking Conference (WCNC)","author":"Masroor","year":"2024"},{"key":"2026012711402433100_ref48","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1080\/19488300.2011.617718","article-title":"Patient and resource scheduling of multi-step medical procedures in nuclear medicine","volume":"1","author":"P\u00e9rez","year":"2011","journal-title":"IIE Transactions on Healthcare Systems Engineering"},{"key":"2026012711402433100_ref49","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","article-title":"The benders decomposition algorithm: a literature review","volume":"259","author":"Rahmaniani","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"2026012711402433100_ref50","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1017\/S147106841100007X","article-title":"Team-building with answer set programming in the Gioia-Tauro seaport","volume":"12","author":"Ricca","year":"2012","journal-title":"Theory and Practice of Logic Programming"},{"key":"2026012711402433100_ref51","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/j.ejor.2016.06.015","article-title":"Recursive logic-based benders\u2019 decomposition for multi-mode outpatient scheduling","volume":"255","author":"Riise","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"2026012711402433100_ref52","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/j.ejor.2016.08.024","article-title":"Propagating logic-based benders\u2019 decomposition approaches for distributed operating room scheduling","volume":"257","author":"Roshanaei","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"2026012711402433100_ref53","volume-title":"Input\/Output Format and Solver Requirements for the Competitions of Pseudo-Boolean Solvers","author":"Roussel","year":"2012."},{"key":"2026012711402433100_ref54","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-319-40970-2_34","article-title":"LMHS: a SAT-IP hybrid maxsat solver","volume-title":"Sat 2016. LNCS","author":"Saikko","year":"2016"},{"key":"2026012711402433100_ref55","article-title":"Towards automatic composition of ASP programs from natural language specifications","volume-title":"Proc. of IJCAI","author":"Santana","year":"2024"},{"key":"2026012711402433100_ref56","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s11604-023-01474-3","article-title":"Fairness of artificial intelligence in healthcare: review and recommendations","volume":"42","author":"Ueda","year":"2024","journal-title":"Japanese Journal of Radiology"},{"key":"2026012711402433100_ref57","first-page":"5148215:1","article-title":"Online appointment scheduling for a nuclear medicine department in a chinese hospital","volume-title":"Computational and Mathematical Methods in Medicine,","author":"Xiao","year":"2018"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/36\/2\/exaf071\/66591339\/exaf071.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/36\/2\/exaf071\/66591339\/exaf071.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T16:40:35Z","timestamp":1769532035000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/doi\/10.1093\/logcom\/exaf071\/8442303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,26]]},"references-count":57,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,1,26]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exaf071","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,3]]},"published":{"date-parts":[[2026,1,26]]},"article-number":"exaf071"}}