Support-based distributed optimisation: An approach to radiotherapy scheduling

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The public health system is plagued by inefficient use of resources. Frequently, the results are lengthy patient treatment waiting times. While many solutions for patient scheduling in health systems exist, few address the problem of coordination between independent autonomous departments. In this study, we describe the use of a distributed dynamic constraint optimisation algorithm (Support Based Distributed Optimisation) for the generation and optimisation of schedules across autonomous units. We model the problem of scheduling radiotherapy patients across several independent oncology units as a dynamic distributed constraint optimisation problem. Such an approach minimises the sharing of private information such as department operation details as well as patient privacy information while taking into consideration patient preferences as well as resource utilisation to find a pareto-optimal solution. © 2011 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

Cite

CITATION STYLE

APA

Billiau, G., Chang, C. F., Ghose, A., & Miller, A. (2011). Support-based distributed optimisation: An approach to radiotherapy scheduling. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 69 LNICST, pp. 327–334). https://doi.org/10.1007/978-3-642-23635-8_41

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