Joint Patient Selection and Scheduling under No-Shows: Theory and Application in Proton Therapy

S. Saghafian, Nikolaos Trichakis, Ruihao Zhu, H. Shih
{"title":"Joint Patient Selection and Scheduling under No-Shows: Theory and Application in Proton Therapy","authors":"S. Saghafian, Nikolaos Trichakis, Ruihao Zhu, H. Shih","doi":"10.2139/ssrn.3396096","DOIUrl":null,"url":null,"abstract":"Motivated by operational challenges facing adopters of new technologies in the healthcare sector, we study how to admit and schedule heterogeneous patients when capacity is scarce. We model schedule-dependent no-show behavior and overtime costs as two important features that can significantly affect operational performance. We start by formulating the problem as a nonlinear integer optimization problem. However, since the solution to this formulation lacks both tractability and interpretability, to be relevant to practice, we limit our study to simple and interpretable policies that can be implemented in practice. In particular, we propose a simple index-based rule and derive analytical performance guarantees for it, which reveal its strong performance compared to the optimal solution. Our analytical performance analysis also demonstrates the robustness of the proposed policy to potential misspecification of no-show probabilities which are hard to accurately estimate in practice. \n \nImportantly, we test the validating of our approach through partnership with the proton therapy center of Massachusetts General Hospital (MGH), which offers a new radiation technology for cancer patients. We calibrate our model using empirical data from our partner hospital, and conduct a series of experiments to evaluate the performance of our proposed policy under practical circumstances. Put together, these experiments show that our proposed policy, despite being a simple and interpretable index-based rule, is capable of improving performance by about 20\\% at an organization such as MGH, and of delivering results that are not far from being optimal across a wide range of parameters that might vary between organizations. This suggests that the proposed policy can be viewed as an effective “one-fits-all” capacity allocation rule that can be used in a variety of environments in which operational challenges such as no-shows and overtime costs need to be navigated using simple and interpretable rules.","PeriodicalId":110014,"journal":{"name":"John F. Kennedy School of Government Faculty Research Working Paper Series","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"John F. Kennedy School of Government Faculty Research Working Paper Series","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3396096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Motivated by operational challenges facing adopters of new technologies in the healthcare sector, we study how to admit and schedule heterogeneous patients when capacity is scarce. We model schedule-dependent no-show behavior and overtime costs as two important features that can significantly affect operational performance. We start by formulating the problem as a nonlinear integer optimization problem. However, since the solution to this formulation lacks both tractability and interpretability, to be relevant to practice, we limit our study to simple and interpretable policies that can be implemented in practice. In particular, we propose a simple index-based rule and derive analytical performance guarantees for it, which reveal its strong performance compared to the optimal solution. Our analytical performance analysis also demonstrates the robustness of the proposed policy to potential misspecification of no-show probabilities which are hard to accurately estimate in practice. Importantly, we test the validating of our approach through partnership with the proton therapy center of Massachusetts General Hospital (MGH), which offers a new radiation technology for cancer patients. We calibrate our model using empirical data from our partner hospital, and conduct a series of experiments to evaluate the performance of our proposed policy under practical circumstances. Put together, these experiments show that our proposed policy, despite being a simple and interpretable index-based rule, is capable of improving performance by about 20\% at an organization such as MGH, and of delivering results that are not far from being optimal across a wide range of parameters that might vary between organizations. This suggests that the proposed policy can be viewed as an effective “one-fits-all” capacity allocation rule that can be used in a variety of environments in which operational challenges such as no-shows and overtime costs need to be navigated using simple and interpretable rules.
缺席情况下联合患者选择与调度:质子治疗的理论与应用
由于医疗保健部门新技术采用者面临的运营挑战,我们研究了在能力不足的情况下如何接纳和安排异质性患者。我们将与计划相关的缺席行为和加班成本作为可以显著影响运营绩效的两个重要特征进行建模。我们首先将问题表述为一个非线性整数优化问题。然而,由于这个公式的解决方案缺乏可追溯性和可解释性,为了与实践相关,我们将研究限制在可以在实践中实施的简单和可解释的政策上。特别地,我们提出了一个简单的基于索引的规则,并推导了它的分析性能保证,与最优解相比,它的性能更强。我们的分析性能分析还证明了所提出的策略对在实践中难以准确估计的潜在不出现概率的错误说明具有鲁棒性。重要的是,我们通过与麻省总医院(MGH)质子治疗中心的合作来验证我们的方法的有效性,该中心为癌症患者提供了一种新的放射技术。我们使用合作医院的经验数据来校准我们的模型,并进行一系列实验来评估我们提出的政策在实际情况下的表现。综上所述,这些实验表明,尽管我们提出的策略是一个简单且可解释的基于索引的规则,但它能够将MGH等组织的性能提高约20%,并且在组织之间可能存在差异的广泛参数范围内提供接近最佳的结果。这表明,建议的策略可以被视为一种有效的“一刀切”的容量分配规则,可以在各种环境中使用,在这些环境中,需要使用简单且可解释的规则来处理诸如缺席和加班成本之类的操作挑战。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信