Examination-order scheduling for minimizing waiting time: A case study of a medical checkup

IF 1.5 Q3 HEALTH CARE SCIENCES & SERVICES
Mari Ito , Shizuka Hara , Mirai Tanaka , Ryuta Takashima
{"title":"Examination-order scheduling for minimizing waiting time: A case study of a medical checkup","authors":"Mari Ito ,&nbsp;Shizuka Hara ,&nbsp;Mirai Tanaka ,&nbsp;Ryuta Takashima","doi":"10.1016/j.orhc.2019.100190","DOIUrl":null,"url":null,"abstract":"<div><p>This paper introduces a mathematical programming model and a heuristic method for examination-order scheduling in medical checkup. The purpose of this scheduling is to minimize the time spent waiting for medical examinations. We create the examination-order schedule based on the expected throughput of examinations. The obtained schedules improved efficiency by reducing the total time spent waiting. Comparisons with previously used scheduling methods demonstrate the efficiency of our scheduling method. We find that the labor cost decreases due to reduction in waiting times. Furthermore, it is shown that the heuristic method proposed in this study has a robustness to the results by means of a Monte Carlo simulation.</p></div>","PeriodicalId":46320,"journal":{"name":"Operations Research for Health Care","volume":"22 ","pages":"Article 100190"},"PeriodicalIF":1.5000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.orhc.2019.100190","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research for Health Care","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2211692318300699","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"HEALTH CARE SCIENCES & SERVICES","Score":null,"Total":0}
引用次数: 1

Abstract

This paper introduces a mathematical programming model and a heuristic method for examination-order scheduling in medical checkup. The purpose of this scheduling is to minimize the time spent waiting for medical examinations. We create the examination-order schedule based on the expected throughput of examinations. The obtained schedules improved efficiency by reducing the total time spent waiting. Comparisons with previously used scheduling methods demonstrate the efficiency of our scheduling method. We find that the labor cost decreases due to reduction in waiting times. Furthermore, it is shown that the heuristic method proposed in this study has a robustness to the results by means of a Monte Carlo simulation.

减少等待时间的检查顺序安排:一个医疗检查的案例研究
介绍了医疗体检中检查顺序调度的数学规划模型和启发式方法。这样安排的目的是尽量减少等待体检的时间。我们根据考试的预期吞吐量创建考试订单时间表。获得的调度通过减少总等待时间来提高效率。通过与已有调度方法的比较,证明了该调度方法的有效性。我们发现,由于等待时间的减少,人工成本降低了。此外,通过蒙特卡罗仿真表明,本文提出的启发式方法对结果具有较强的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Operations Research for Health Care
Operations Research for Health Care HEALTH CARE SCIENCES & SERVICES-
CiteScore
3.90
自引率
0.00%
发文量
9
审稿时长
69 days
×
引用
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学术官方微信