{"title":"Data-driven appointment scheduling","authors":"D. Fiems","doi":"10.1145/3306309.3306311","DOIUrl":null,"url":null,"abstract":"We consider the problem of evaluating and constructing appointment schedules for patients in a health-care facility where a single physician treats patients in consecutive order, as is common for general practitioners, clinics and for outpatients in hospitals. Specifically, given a fixed-length session during which a physician sees K patients, each patient has to be given an appointment time during this session in advance. Optimising a schedule with respect to patient waiting times, physician idle times, session overtime, etc. usually requires a heuristic search method involving a huge number of repeated schedule evaluations. Methods for lowering the computational cost of obtaining accurate predictions is the main thread of this talk. Borrowing from queueing theory, we first show that a Lindley-type recursion in a discrete-time framework can be used to obtain accurate predictions for the moments of the patient waiting times and the doctor's idle times and overtime in the simplest setting where patients are identical, punctual and always show up. Unfortunately, in realistic scenarios, patients are neither statistically identical (in many scenarios, the consultation times of particular patients can be estimated based on the lengths of prior consultations of the same patient or of patients with similar conditions) nor punctual and a considerable number of patients do not show up. Various extensions to evaluate schedules with unpunctuality and no-shows are discussed, both completely numerical methods as well as methods which combine numerical results and Monte-Carlo simulation. The evaluation methods are then used in combination with a local search algorithm to optimise the schedule. Finally, noting that it is often beneficial to be scheduled early during a session, we consider an appointment game in which patients can opt to be seen in a later session, as to reduce their waiting during the session. Both the unobservable and observable game are considered, i.e., the patients are either aware of the number of patients already scheduled in the future sessions, or they are not.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3306309.3306311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We consider the problem of evaluating and constructing appointment schedules for patients in a health-care facility where a single physician treats patients in consecutive order, as is common for general practitioners, clinics and for outpatients in hospitals. Specifically, given a fixed-length session during which a physician sees K patients, each patient has to be given an appointment time during this session in advance. Optimising a schedule with respect to patient waiting times, physician idle times, session overtime, etc. usually requires a heuristic search method involving a huge number of repeated schedule evaluations. Methods for lowering the computational cost of obtaining accurate predictions is the main thread of this talk. Borrowing from queueing theory, we first show that a Lindley-type recursion in a discrete-time framework can be used to obtain accurate predictions for the moments of the patient waiting times and the doctor's idle times and overtime in the simplest setting where patients are identical, punctual and always show up. Unfortunately, in realistic scenarios, patients are neither statistically identical (in many scenarios, the consultation times of particular patients can be estimated based on the lengths of prior consultations of the same patient or of patients with similar conditions) nor punctual and a considerable number of patients do not show up. Various extensions to evaluate schedules with unpunctuality and no-shows are discussed, both completely numerical methods as well as methods which combine numerical results and Monte-Carlo simulation. The evaluation methods are then used in combination with a local search algorithm to optimise the schedule. Finally, noting that it is often beneficial to be scheduled early during a session, we consider an appointment game in which patients can opt to be seen in a later session, as to reduce their waiting during the session. Both the unobservable and observable game are considered, i.e., the patients are either aware of the number of patients already scheduled in the future sessions, or they are not.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
数据驱动预约调度
我们考虑的问题是评估和构建保健设施中患者的预约时间表,其中一名医生连续治疗患者,这在全科医生、诊所和医院的门诊患者中很常见。具体来说,在固定时间内,医生要为K名患者看病,在此期间,每位患者都要提前预约时间。根据患者等待时间、医生空闲时间、会话超时时间等因素来优化时间表,通常需要一种启发式搜索方法,该方法涉及大量重复的时间表评估。降低获得准确预测的计算成本的方法是本次演讲的主线。借用排队理论,我们首先证明了离散时间框架下的lindley型递归可以在患者相同、准时且总是出现的最简单设置下获得患者等待时间时刻和医生空闲时间和加班时间的准确预测。不幸的是,在现实情况下,患者在统计上既不相同(在许多情况下,特定患者的咨询时间可以根据同一患者或病情相似的患者先前咨询的长度来估计),也不准时,相当多的患者没有出现。讨论了计算不守时和不守时情况下的各种扩展方法,既有完全数值方法,也有数值结果与蒙特卡罗模拟相结合的方法。然后将评估方法与局部搜索算法结合使用,以优化调度。最后,注意到在治疗过程中尽早安排通常是有益的,我们考虑了一种预约游戏,患者可以选择在晚些时候就诊,以减少他们在治疗过程中的等待时间。我们同时考虑了不可观察和可观察的游戏,也就是说,患者要么知道未来会议中已经安排的患者数量,要么不知道。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Revenue-Driven Scheduling in Drone Delivery Networks with Time-sensitive Service Level Agreements A proof of the conjecture in "Pricing surplus server capacity for mean waiting time sensitive customers" Tandem stochastic systems: Jackson networks, asymmetric exclusion processes, asymmetric inclusion processes and Catalan numbers Ultimately Stationary Policies to Approximate Risk-Sensitive Discounted MDPs A bottleneck with randomly distorted arrival times
×
引用
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