Optimal outpatient appointment scheduling with emergency arrivals and general service times

P. Koeleman, G. Koole
{"title":"Optimal outpatient appointment scheduling with emergency arrivals and general service times","authors":"P. Koeleman, G. Koole","doi":"10.1080/19488300.2012.665154","DOIUrl":null,"url":null,"abstract":"Abstract In this paper we study the problem of deciding at what times to schedule non-emergency patients when there are emergency arrivals following a non-stationary Poisson process. The service times can have any given distribution. The objective function consists of a weighted sum of the waiting times, idle time and overtime. We prove that this objective function is multimodular, and then use a local search algorithm which in that case is guaranteed to find the optimal solution. Numerical examples show that this method gives considerable improvements over the standard even-spaced schedule, and that the schedules for different service time distributions can look quite different.","PeriodicalId":89563,"journal":{"name":"IIE transactions on healthcare systems engineering","volume":"2 1","pages":"14 - 30"},"PeriodicalIF":0.0000,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/19488300.2012.665154","citationCount":"57","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IIE transactions on healthcare systems engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/19488300.2012.665154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 57

Abstract

Abstract In this paper we study the problem of deciding at what times to schedule non-emergency patients when there are emergency arrivals following a non-stationary Poisson process. The service times can have any given distribution. The objective function consists of a weighted sum of the waiting times, idle time and overtime. We prove that this objective function is multimodular, and then use a local search algorithm which in that case is guaranteed to find the optimal solution. Numerical examples show that this method gives considerable improvements over the standard even-spaced schedule, and that the schedules for different service time distributions can look quite different.
最佳门诊预约调度与紧急到达和一般服务时间
摘要本文研究了一个非平稳泊松过程,当有急诊病人到达时,在什么时间安排非急诊病人的问题。服务时间可以有任何给定的分布。目标函数由等待时间、空闲时间和超时时间的加权和组成。首先证明了该目标函数是多模的,然后使用局部搜索算法,在这种情况下保证找到最优解。数值算例表明,该方法比标准的均匀间隔调度有很大的改进,并且不同服务时间分布的调度看起来可能有很大的不同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信