A data-driven approach to solve the RT scheduling problem

Mruga Gurjar , Jesper Lindberg , Thomas Björk-Eriksson , Caroline Olsson
{"title":"A data-driven approach to solve the RT scheduling problem","authors":"Mruga Gurjar ,&nbsp;Jesper Lindberg ,&nbsp;Thomas Björk-Eriksson ,&nbsp;Caroline Olsson","doi":"10.1016/j.tipsro.2024.100282","DOIUrl":null,"url":null,"abstract":"<div><h3>Introduction</h3><div>There is an increase in demand for Radiotherapy (RT) and it is a time critical treatment with a complex scheduling process. RT workflow is inter-dependent and involves various steps including pre-treatment and treatment-related tasks which adds to these challenges. Globally, scheduling delays are reported as one of the most common issues in RT. We aim to create and evaluate an automated strategy which generates a patient allocation list to assist the scheduling staff to create an efficient scheduling process.</div></div><div><h3>Methods and Materials</h3><div>We used historical data from a large RT department in Sweden from January to December 2022 with 11–13 operational linear accelerators. The algorithm was developed in C# language. It utilizes patient and treatment-related characteristics including the patient timeline (referral date, preferred treatment start dates), booking category, diagnosis group and intent. Based on this, the algorithm assigns patient priority individually.</div></div><div><h3>Results</h3><div>The algorithm’s output resulted in a scheduling list sorted by high to low patient priority per week. We evaluated the algorithm with historical manual allocations from the same year. The comparison between manual and algorithm allocations showed that the number of delayed patients reduced by 10 % in the algorithm suggestion with an average delay reduction of 2 weeks. Furthermore, the focus on patient-related characteristics resulted in diagnosis groups being better balanced.</div></div><div><h3>Conclusion</h3><div>The algorithm’s ability to produce quick results may save significant time that the scheduling staff otherwise need to assess individual patient profiles. RT departments can incorporate such algorithms to accelerate their scheduling decisions and enhance their overall scheduling performance before going through major organizational changes.</div></div>","PeriodicalId":36328,"journal":{"name":"Technical Innovations and Patient Support in Radiation Oncology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Technical Innovations and Patient Support in Radiation Oncology","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2405632424000490","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Nursing","Score":null,"Total":0}
引用次数: 0

Abstract

Introduction

There is an increase in demand for Radiotherapy (RT) and it is a time critical treatment with a complex scheduling process. RT workflow is inter-dependent and involves various steps including pre-treatment and treatment-related tasks which adds to these challenges. Globally, scheduling delays are reported as one of the most common issues in RT. We aim to create and evaluate an automated strategy which generates a patient allocation list to assist the scheduling staff to create an efficient scheduling process.

Methods and Materials

We used historical data from a large RT department in Sweden from January to December 2022 with 11–13 operational linear accelerators. The algorithm was developed in C# language. It utilizes patient and treatment-related characteristics including the patient timeline (referral date, preferred treatment start dates), booking category, diagnosis group and intent. Based on this, the algorithm assigns patient priority individually.

Results

The algorithm’s output resulted in a scheduling list sorted by high to low patient priority per week. We evaluated the algorithm with historical manual allocations from the same year. The comparison between manual and algorithm allocations showed that the number of delayed patients reduced by 10 % in the algorithm suggestion with an average delay reduction of 2 weeks. Furthermore, the focus on patient-related characteristics resulted in diagnosis groups being better balanced.

Conclusion

The algorithm’s ability to produce quick results may save significant time that the scheduling staff otherwise need to assess individual patient profiles. RT departments can incorporate such algorithms to accelerate their scheduling decisions and enhance their overall scheduling performance before going through major organizational changes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
解决 RT 调度问题的数据驱动方法
导言放疗(RT)的需求不断增加,它是一种时间紧迫、调度过程复杂的治疗方法。放疗工作流程相互依赖,涉及各种步骤,包括治疗前和治疗相关任务,这增加了这些挑战。据报道,全球范围内,排程延误是 RT 中最常见的问题之一。我们的目标是创建并评估一种自动生成患者分配列表的策略,以协助排班人员创建高效的排班流程。方法和材料我们使用了瑞典一个大型 RT 部门 2022 年 1 月至 12 月的历史数据,该部门有 11-13 台运行中的直线加速器。该算法使用 C# 语言开发。它利用了患者和治疗相关的特征,包括患者时间轴(转诊日期、首选治疗开始日期)、预约类别、诊断组和意向。在此基础上,该算法逐一分配患者的优先级。结果该算法的输出结果是每周按患者优先级从高到低排序的排班列表。我们将该算法与同年的历史手动分配进行了评估。人工排班与算法排班的比较结果表明,算法排班的延误病人数量减少了 10%,平均延误时间减少了 2 周。此外,对患者相关特征的关注使诊断组之间更加平衡。在进行重大组织变革之前,急诊科可以采用这种算法来加快排班决策,提高整体排班绩效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
4.10
自引率
0.00%
发文量
48
审稿时长
67 days
期刊最新文献
The status quo of global geriatric radiation oncology education: A scoping review A systematic review of prostate bed motion and anisotropic margins in post-prostatectomy external beam radiotherapy International virtual radiation therapy professional development: Reflections on a twinning collaboration between a low/middle and high income country A code orange for traffic-light-protocols as a communication mechanism in IGRT On the trail of CBCT-guided adaptive rectal boost radiotherapy, does daily delineation require a radiation oncologist?
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1