Effective optimisation of the patient circuits of an oncology day hospital: Mathematical programming models and case study
Loading...
Identifiers
Publication date
Advisors
Tutors
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
MDPI
Abstract
In this paper, we first use the information we have on the patients of an oncology day hospital to distribute the treatment schedules they have in each of the visits to this centre. To do this, we propose a deterministic mathematical programming model in such a way that we minimise the duration of the waiting room stays of the total set of patients and taking into account the restrictions of the circuit. Secondly, we will look for a solution to the same problem under a stochastic approach. This model will explicitly consider the existing uncertainty in terms of the different times involved in the circuit, and this model also allows the reorganisation of the schedules of medical appointments with oncologists. The models are complemented by a tool that solves the problem of assigning nurses to patients. The work is motivated by the particular characteristics of a real hospital and the models are used and compared with data from this case.
Description
Bibliographic citation
González-Maestro, A.; Brozos-Vázquez, E.; Casas-Méndez, B.; López-López, R.; López-Rodríguez, R.; Reyes-Santias, F. Effective Optimisation of the Patient Circuits of an Oncology Day Hospital: Mathematical Programming Models and Case Study. Mathematics 2022, 10, 62
Relation
Has part
Has version
Is based on
Is part of
Is referenced by
Is version of
Requires
Publisher version
https://doi.org/10.3390/math10010062Sponsors
This research has been funded by the ERDF, the Government of Spain/AEI [grant MTM2017-
87197-C3-3-P] and the Xunta de Galicia [Grupos de Referencia Competitiva ED431C2017/38, and ED431C
2021/24].
Rights
©2021 by the authors. LicenseeMDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution(CCBY) license.








