Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-10T21:15:17.611Z Has data issue: false hasContentIssue false

An ASP-based Solution to the Chemotherapy Treatment Scheduling problem

Published online by Cambridge University Press:  24 September 2021

CARMINE DODARO
Affiliation:
University of Calabria, Italy (e-mail: dodaro@mat.unical.it)
GIUSEPPE GALATÁ
Affiliation:
SurgiQ srl, Italy (e-mail: giuseppe.galata@surgiq.com)
ANDREA GRIONI
Affiliation:
San Martino Hospital, Italy (e-mail: andrea.grioni@hsanmartino.it)
MARCO MARATEA
Affiliation:
University of Genoa, Italy (e-mail: marco.mochi@unige.it)
MARCO MOCHI
Affiliation:
University of Genoa, Italy (e-mail: marco.mochi@unige.it)
IVAN PORRO
Affiliation:
SurgiQ srl, Italy (e-mail: ivan.porro@surgiq.com)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Original Article
Copyright
© The Author(s), 2021. Published by Cambridge University Press