Machine Learning to Predict-Then-Optimize Elective Orthopaedic Surgery Scheduling Improves Operating Room Utilization

MASc Johnathan R. Lex MBChB, Jacob Mosseri BASc MASc, Mba Frcsc Jay Toor MD, Aazad Abbas HBSc, Michael Simone BASc, Bheeshma Ravi, Cari M. Whyne, Elias B. Khalil
{"title":"Machine Learning to Predict-Then-Optimize Elective Orthopaedic Surgery Scheduling Improves Operating Room Utilization","authors":"MASc Johnathan R. Lex MBChB, Jacob Mosseri BASc MASc, Mba Frcsc Jay Toor MD, Aazad Abbas HBSc, Michael Simone BASc, Bheeshma Ravi, Cari M. Whyne, Elias B. Khalil","doi":"10.1101/2024.08.10.24311370","DOIUrl":null,"url":null,"abstract":"Objective: To determine the potential for improving elective surgery scheduling for total knee and hip arthroplasty (TKA and THA, respectively) by utilizing a two-stage approach that incorporates machine learning (ML) prediction of the duration of surgery (DOS) with scheduling optimization. Materials and Methods: Two ML models (for TKA and THA) were trained to predict DOS using patient factors based on 302,490 and 196,942 examples, respectively, from a large international database. Three optimization formulations based on varying surgeon flexibility were compared: Any- surgeons could operate in any operating room at any time, Split- limitation of two surgeons per operating room per day, and MSSP- limit of one surgeon per operating room per day. Two years of daily scheduling simulations were performed for each optimization problem using ML-prediction or mean DOS over a range of schedule parameters. Constraints and resources were based on a high volume arthroplasty hospital in Canada. Results: The Any scheduling formulation performed significantly worse than the Split and MSSP formulations with respect to overtime and underutilization (p<0.001). The latter two problems performed similarly (p>0.05) over most schedule parameters. The ML-prediction schedules outperformed those generated using a mean DOS over all schedule parameters, with overtime reduced on average by 300 to 500 minutes per week. Using a 15-minute schedule granularity with a wait list pool of minimum 1 month generated the best schedules. Conclusion: Assuming a full waiting list, optimizing an individual surgeons elective operating room time using an ML-assisted predict-then optimize scheduling system improves overall operating room efficiency, significantly decreasing overtime.","PeriodicalId":18505,"journal":{"name":"medRxiv","volume":"18 6","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"medRxiv","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1101/2024.08.10.24311370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Objective: To determine the potential for improving elective surgery scheduling for total knee and hip arthroplasty (TKA and THA, respectively) by utilizing a two-stage approach that incorporates machine learning (ML) prediction of the duration of surgery (DOS) with scheduling optimization. Materials and Methods: Two ML models (for TKA and THA) were trained to predict DOS using patient factors based on 302,490 and 196,942 examples, respectively, from a large international database. Three optimization formulations based on varying surgeon flexibility were compared: Any- surgeons could operate in any operating room at any time, Split- limitation of two surgeons per operating room per day, and MSSP- limit of one surgeon per operating room per day. Two years of daily scheduling simulations were performed for each optimization problem using ML-prediction or mean DOS over a range of schedule parameters. Constraints and resources were based on a high volume arthroplasty hospital in Canada. Results: The Any scheduling formulation performed significantly worse than the Split and MSSP formulations with respect to overtime and underutilization (p<0.001). The latter two problems performed similarly (p>0.05) over most schedule parameters. The ML-prediction schedules outperformed those generated using a mean DOS over all schedule parameters, with overtime reduced on average by 300 to 500 minutes per week. Using a 15-minute schedule granularity with a wait list pool of minimum 1 month generated the best schedules. Conclusion: Assuming a full waiting list, optimizing an individual surgeons elective operating room time using an ML-assisted predict-then optimize scheduling system improves overall operating room efficiency, significantly decreasing overtime.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过机器学习预测并优化骨科择期手术排期,提高手术室利用率
目的利用机器学习(ML)预测手术持续时间(DOS)和优化排期的两阶段方法,确定改善全膝关节和髋关节置换术(分别为 TKA 和 THA)择期手术排期的潜力。材料与方法:分别根据大型国际数据库中的 302,490 例和 196,942 例实例,使用患者因素对两个 ML 模型(TKA 和 THA)进行训练,以预测 DOS。比较了基于不同外科医生灵活性的三种优化方案:Any--外科医生可以在任何时间在任何手术室进行手术;Split--限制每天每个手术室有两名外科医生;MSSP--限制每天每个手术室有一名外科医生。针对每个优化问题,使用 ML 预测法或平均 DOS 法对一系列日程参数进行了为期两年的每日日程安排模拟。约束条件和资源以加拿大一家高产量关节成形术医院为基础。结果:在大多数日程参数下,任何日程安排方案在超时和利用不足方面的表现明显差于 Split 和 MSSP 方案(P0.05)。在所有排程参数上,ML 预测排程的表现优于使用平均 DOS 生成的排程,每周平均减少加班 300 到 500 分钟。使用 15 分钟的计划粒度和最少 1 个月的候补名单池生成了最佳计划。结论假定有完整的候诊名单,使用 ML 辅助的 "先预测后优化 "排班系统优化外科医生的择期手术室时间,可提高手术室的整体效率,显著减少加班时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Factors determining hemoglobin levels in vaginally delivered term newborns at public hospitals in Lusaka, Zambia Accurate and cost-efficient whole genome sequencing of hepatitis B virus using Nanopore Mapping Epigenetic Gene Variant Dynamics: Comparative Analysis of Frequency, Functional Impact and Trait Associations in African and European Populations Assessing Population-level Accessibility to Medical College Hospitals in India: A Geospatial Modeling Study Targeted inference to identify drug repositioning candidates in the Danish health registries
×
引用
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