An ASP-based Solution to the Chemotherapy Treatment Scheduling problem

48Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Dodaro, C., Galatá, G., Grioni, A., Maratea, M., Mochi, M., & Porro, I. (2021). An ASP-based Solution to the Chemotherapy Treatment Scheduling problem. Theory and Practice of Logic Programming, 21(6), 835–851. https://doi.org/10.1017/S1471068421000363

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free