{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T17:33:53Z","timestamp":1772645633625,"version":"3.50.1"},"reference-count":28,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2021,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The problem of scheduling chemotherapy treatments in oncology clinics is a complex problem, given that the solution has to satisfy (as much as possible) several requirements such as the cyclic nature of chemotherapy treatment plans, maintaining a constant number of patients, and the availability of resources, for example, treatment time, nurses, and drugs. At the same time, realizing a satisfying schedule is of upmost importance for obtaining the best health outcomes. In this paper we first consider a specific instance of the problem which is employed in the San Martino Hospital in Genova, Italy, and present a solution to the problem based on Answer Set Programming (ASP). Then, we enrich the problem and the related ASP encoding considering further features often employed in other hospitals, desirable also in S. Martino, and\/or considered in related papers. Results of an experimental analysis, conducted on the real data provided by the San Martino Hospital, show that ASP is an effective solving methodology also for this important scheduling problem.<\/jats:p>","DOI":"10.1017\/s1471068421000363","type":"journal-article","created":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T00:46:08Z","timestamp":1632530768000},"page":"835-851","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":32,"title":["An ASP-based Solution to the Chemotherapy Treatment Scheduling problem"],"prefix":"10.1017","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-5286","authenticated-orcid":false,"given":"CARMINE","family":"DODARO","sequence":"first","affiliation":[]},{"given":"GIUSEPPE","family":"GALAT\u00c1","sequence":"additional","affiliation":[]},{"given":"ANDREA","family":"GRIONI","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9034-2527","authenticated-orcid":false,"given":"MARCO","family":"MARATEA","sequence":"additional","affiliation":[]},{"given":"MARCO","family":"MOCHI","sequence":"additional","affiliation":[]},{"given":"IVAN","family":"PORRO","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2021,9,24]]},"reference":[{"key":"S1471068421000363_ref23","doi-asserted-by":"crossref","unstructured":"Morgado, A. , Dodaro, C. and Marques-Silva, J. 2014. Core-Guided MaxSAT with Soft Cardinality Constraints. In CP 2014. Springer, Lyon, France, 564\u2013573.","DOI":"10.1007\/978-3-319-10428-7_41"},{"key":"S1471068421000363_ref4","unstructured":"Brewka, G. , Delgrande, J. P. , Romero, J. and Schaub, T. 2015. asprin: Customizing answer set preferences without a headache. In AAAI 2015. AAAI Press, 1467\u20131474."},{"key":"S1471068421000363_ref6","unstructured":"Davies, J. 2013. Solving maxsat by decoupling optimization and satisfaction. Ph.D. thesis, University of Toronto."},{"key":"S1471068421000363_ref3","unstructured":"Ans\u00f3tegui, C. , Pacheco, T. and Pon, J. 2019. Pypblib."},{"key":"S1471068421000363_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-018-0548-6"},{"key":"S1471068421000363_ref24","unstructured":"Olivier, Roussel and Vasco, Manquinho . 2012. Input\/Output Format and Solver Requirements for the Competitions of Pseudo-Boolean Solvers."},{"key":"S1471068421000363_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10729-014-9268-0"},{"key":"S1471068421000363_ref7","unstructured":"Dodaro, C. , Galat\u00e0, G. , Maratea, M. , Mochi, M. and Porro, I. 2020. Chemotherapy treatment scheduling via answer set programming. In CILC 2020. CEUR Workshop Proceedings, vol. 2710. CEUR-WS.org, 342\u2013356."},{"key":"S1471068421000363_ref21","doi-asserted-by":"publisher","DOI":"10.1080\/19488300.2016.1189469"},{"key":"S1471068421000363_ref8","doi-asserted-by":"crossref","unstructured":"Dodaro, C. , Galat\u00e0, G. , Maratea, M. and Porro, I. 2018. Operating room scheduling via answer set programming. In AI*IA. LNCS, vol. 11298. Springer, 445\u2013459.","DOI":"10.1007\/978-3-030-03840-3_33"},{"key":"S1471068421000363_ref14","unstructured":"Gurobi Optimization, LLC. 2021. Gurobi Optimizer Reference Manual."},{"key":"S1471068421000363_ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i3.2678"},{"key":"S1471068421000363_ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000182"},{"key":"S1471068421000363_ref25","first-page":"2","article-title":"Answer set programming in linguistics","volume":"32","author":"Sch\u00fcller","year":"2018","journal-title":"K\u00fcnstliche Intelligence"},{"key":"S1471068421000363_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-019-03500-y"},{"key":"S1471068421000363_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2013.10.012"},{"key":"S1471068421000363_ref12","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Kaufmann, B. and Schaub, T. 2012. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187, 52\u201389.","DOI":"10.1016\/j.artint.2012.04.001"},{"key":"S1471068421000363_ref2","unstructured":"Alviano, M. , Bertolucci, R. , Cardellini, M. , Dodaro, C. , Galat\u00e0, G. , Khan, M. K. , Maratea, M. , Mochi, M. , Morozan, V. , Porro, I. and Schouten, M. 2020. Answer set programming in healthcare: Extended overview. In IPS and RCRA 2020. CEUR Workshop Proceedings, vol. 2745. CEUR-WS.org."},{"key":"S1471068421000363_ref18","unstructured":"Huggins, A. , Claudio, D. and P\u00e9rez, E. 2014. Improving resource utilization in a cancer clinic: An optimization model. In IIE Annual Conference and Expo 2014."},{"key":"S1471068421000363_ref11","unstructured":"Gebser, M. , Kaminski, R. , Kaufmann, B. , Ostrowski, M. , Schaub, T. and Wanko, P. 2016. Theory solving made easy with clingo 5. In ICLP (Technical Communications). OASICS, vol. 52. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2:1\u20132:15."},{"key":"S1471068421000363_ref1","doi-asserted-by":"crossref","unstructured":"Alviano, M. , Amendola, G. , Dodaro, C. , Leone, N. , Maratea, M. and Ricca, F. 2019. Evaluation of disjunctive programs in WASP. In LPNMR 2019. LNCS, vol. 11481. Springer, 241\u2013255.","DOI":"10.1007\/978-3-030-20528-7_18"},{"key":"S1471068421000363_ref20","doi-asserted-by":"publisher","DOI":"10.7189\/jogh.10.010367"},{"key":"S1471068421000363_ref17","doi-asserted-by":"publisher","DOI":"10.1200\/JOP.2017.025510"},{"key":"S1471068421000363_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000450"},{"key":"S1471068421000363_ref28","doi-asserted-by":"publisher","DOI":"10.1080\/19488300.2012.665155"},{"key":"S1471068421000363_ref19","first-page":"53","article-title":"RC2: an efficient maxsat solver","volume":"11","author":"Ignatiev","year":"2019","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"S1471068421000363_ref22","doi-asserted-by":"crossref","unstructured":"Martins, R. , Manquinho, V. M. and Lynce, I. 2014. Open-wbo: A modular maxsat solver,. In SAT 2014. LNCS, vol. 8561. Springer, 438\u2013445.","DOI":"10.1007\/978-3-319-09284-3_33"},{"key":"S1471068421000363_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.annonc.2020.05.009"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068421000363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T10:17:51Z","timestamp":1641464271000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068421000363\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,24]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["S1471068421000363"],"URL":"https:\/\/doi.org\/10.1017\/s1471068421000363","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,24]]},"assertion":[{"value":"\u00a9 The Author(s), 2021. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}