A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients

IF 1.4 4区 工程技术 Q4 ENGINEERING, MANUFACTURING
{"title":"A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients","authors":"","doi":"10.1007/s10951-023-00802-9","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>No-shows and non-punctual appointments have always been uncertain factors faced by managers of service-oriented enterprises and institutions, which usually lead to a low utilization rate of resources and a rapid decline in service satisfaction. Taking clinics as an example, this paper proposes a novel and efficient real-time sequencing strategy to minimize the cost associated with patient waiting time, provider idle time and overtime considering no-shows and unpunctuality. Four types of patient waiting time are considered for the first time, based on which the developed real-time sequencing strategy is used for scheduling the waiting patients when the provider becomes idle. Then, a biased random-key genetic algorithm is adopted to determine the number of patients on appointment slots and the length of each appointment slot. Extensive computational experiments show that the derived real-time sequencing strategy achieves a significant cost reduction compared with the famous FCFS (first come first served) and the state-of-art LAR (the larger of appointment time and real arrival time) rules.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Scheduling","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s10951-023-00802-9","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0

Abstract

No-shows and non-punctual appointments have always been uncertain factors faced by managers of service-oriented enterprises and institutions, which usually lead to a low utilization rate of resources and a rapid decline in service satisfaction. Taking clinics as an example, this paper proposes a novel and efficient real-time sequencing strategy to minimize the cost associated with patient waiting time, provider idle time and overtime considering no-shows and unpunctuality. Four types of patient waiting time are considered for the first time, based on which the developed real-time sequencing strategy is used for scheduling the waiting patients when the provider becomes idle. Then, a biased random-key genetic algorithm is adopted to determine the number of patients on appointment slots and the length of each appointment slot. Extensive computational experiments show that the derived real-time sequencing strategy achieves a significant cost reduction compared with the famous FCFS (first come first served) and the state-of-art LAR (the larger of appointment time and real arrival time) rules.

针对不守时患者的预约排程的高效实时排序新策略
摘 要 无预约和不守时一直是服务型企事业单位管理者面临的不确定因素,通常会导致资源利用率低、服务满意度急剧下降。本文以诊所为例,提出了一种新颖、高效的实时排序策略,以最大限度地减少病人等待时间、服务提供者闲置时间以及考虑到爽约和不守时情况下的加班相关成本。本文首次考虑了四种类型的病人等待时间,在此基础上开发了实时排序策略,用于在医疗服务提供者闲置时安排等待的病人。然后,采用有偏向的随机密钥遗传算法来确定预约时段的患者人数和每个预约时段的长度。大量的计算实验表明,与著名的 FCFS(先到先服务)和最先进的 LAR(预约时间和实际到达时间的较大值)规则相比,衍生的实时排序策略能显著降低成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Scheduling
Journal of Scheduling 工程技术-工程:制造
CiteScore
3.80
自引率
10.00%
发文量
49
审稿时长
6-12 weeks
期刊介绍: The Journal of Scheduling provides a recognized global forum for the publication of all forms of scheduling research. First published in June 1998, Journal of Scheduling covers advances in scheduling research, such as the latest techniques, applications, theoretical issues and novel approaches to problems. The journal is of direct relevance to the areas of Computer Science, Discrete Mathematics, Operational Research, Engineering, Management, Artificial Intelligence, Construction, Distribution, Manufacturing, Transport, Aerospace and Retail and Service Industries. These disciplines face complex scheduling needs and all stand to gain from advances in scheduling technology and understanding.
×
引用
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学术官方微信