Improving patient satisfaction and outpatient diagnostic center efficiency using novel online real-time scheduling

IF 1.5 Q3 HEALTH CARE SCIENCES & SERVICES Operations Research for Health Care Pub Date : 2022-03-01 DOI:10.1016/j.orhc.2022.100338
Varun Jain , Usha Mohan , Zach Zacharia , Nada R. Sanders
{"title":"Improving patient satisfaction and outpatient diagnostic center efficiency using novel online real-time scheduling","authors":"Varun Jain ,&nbsp;Usha Mohan ,&nbsp;Zach Zacharia ,&nbsp;Nada R. Sanders","doi":"10.1016/j.orhc.2022.100338","DOIUrl":null,"url":null,"abstract":"<div><p>We develop a novel online real-time scheduling algorithm with applications for healthcare diagnostic centers to deal with walk-in patients based on a set of constraints on the sequence of tests and resources. The problem is especially significant at healthcare centers in developing and emerging nations, such as India, where appointment schedules do not work. Within this realistic context, our objective is to improve patient satisfaction by reducing waiting time and improve diagnostic center performance through better utilization of the constrained resources. We propose a Mixed Integer Linear Programming (MILP) formulation to represent diagnostic centers as a Flow and Open Shop, to capture the system dynamics of the Flexible Hybrid Shop Scheduling Problem. We then develop a novel Online Genetic Algorithm (OGA) capable of solving real life large scale problems, as Open Shop scheduling problems are NP-hard. The developed OGA is first validated for small instances against a theoretical lower bound and the MILP model using CPLEX solver for flow time and makespan. The OGA is then empirically validated with data collected from two diagnostic centers of different sizes and configurations. For both centers, the developed OGA shows significant improvement compared to the simulation model. This research offers an important contribution to both literature and practice as it is one of the first to model the patient scheduling problem as an online real-time process. Implementing the developed OGA would help diagnostic centers significantly improve time estimates, thus reducing actual patient time and improving the efficiency of the system. Most importantly, the OGA is generalizable beyond healthcare to a broad range of environments that share Hybrid Shop characteristics.</p></div>","PeriodicalId":46320,"journal":{"name":"Operations Research for Health Care","volume":"32 ","pages":"Article 100338"},"PeriodicalIF":1.5000,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research for Health Care","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2211692322000017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"HEALTH CARE SCIENCES & SERVICES","Score":null,"Total":0}
引用次数: 2

Abstract

We develop a novel online real-time scheduling algorithm with applications for healthcare diagnostic centers to deal with walk-in patients based on a set of constraints on the sequence of tests and resources. The problem is especially significant at healthcare centers in developing and emerging nations, such as India, where appointment schedules do not work. Within this realistic context, our objective is to improve patient satisfaction by reducing waiting time and improve diagnostic center performance through better utilization of the constrained resources. We propose a Mixed Integer Linear Programming (MILP) formulation to represent diagnostic centers as a Flow and Open Shop, to capture the system dynamics of the Flexible Hybrid Shop Scheduling Problem. We then develop a novel Online Genetic Algorithm (OGA) capable of solving real life large scale problems, as Open Shop scheduling problems are NP-hard. The developed OGA is first validated for small instances against a theoretical lower bound and the MILP model using CPLEX solver for flow time and makespan. The OGA is then empirically validated with data collected from two diagnostic centers of different sizes and configurations. For both centers, the developed OGA shows significant improvement compared to the simulation model. This research offers an important contribution to both literature and practice as it is one of the first to model the patient scheduling problem as an online real-time process. Implementing the developed OGA would help diagnostic centers significantly improve time estimates, thus reducing actual patient time and improving the efficiency of the system. Most importantly, the OGA is generalizable beyond healthcare to a broad range of environments that share Hybrid Shop characteristics.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用新颖的在线实时调度提高患者满意度和门诊诊断中心效率
我们开发了一种新的在线实时调度算法,应用于医疗诊断中心,以处理基于测试顺序和资源的一组约束的预约患者。这个问题在印度等发展中国家和新兴国家的医疗中心尤为严重,因为这些国家的预约时间表并不有效。在这种现实背景下,我们的目标是通过减少等待时间来提高患者满意度,并通过更好地利用有限的资源来提高诊断中心的绩效。我们提出了一个混合整数线性规划(MILP)公式,将诊断中心表示为一个流动和开放的车间,以捕捉柔性混合车间调度问题的系统动力学。然后,我们开发了一种新的在线遗传算法(OGA),能够解决现实生活中的大规模问题,因为开放车间调度问题是np困难的。首先,利用CPLEX求解器根据理论下界和MILP模型对开发的OGA进行了小实例验证。然后使用从两个不同规模和配置的诊断中心收集的数据对OGA进行经验验证。对于这两个中心,所开发的OGA与仿真模型相比有显著改善。这项研究对文献和实践都有重要的贡献,因为它是第一个将患者调度问题建模为在线实时过程的研究之一。实施开发的OGA将帮助诊断中心显著改善时间估计,从而减少实际患者时间并提高系统效率。最重要的是,OGA可推广到医疗保健之外的各种共享Hybrid Shop特征的环境中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Operations Research for Health Care
Operations Research for Health Care HEALTH CARE SCIENCES & SERVICES-
CiteScore
3.90
自引率
0.00%
发文量
9
审稿时长
69 days
期刊最新文献
Editorial Board Preference-based allocation of patients to nursing homes Balancing continuity of care and home care schedule costs using blueprint routes Outpatient appointment systems: A new heuristic with patient classification A modeling framework for evaluating proactive and reactive nurse rostering strategies — A case study from a Neonatal Intensive Care Unit
×
引用
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