为正在进行的约会设计日历:建模、分析和应用

IF 6.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Industrial Engineering Pub Date : 2025-03-01 Epub Date: 2025-02-06 DOI:10.1016/j.cie.2025.110931
Yossi Luzon , Yariv N. Marmor
{"title":"为正在进行的约会设计日历:建模、分析和应用","authors":"Yossi Luzon ,&nbsp;Yariv N. Marmor","doi":"10.1016/j.cie.2025.110931","DOIUrl":null,"url":null,"abstract":"<div><div>Appointment booking (AB) is a widely used technique for managing elective services like hospital surgical units, law courtrooms, and other services with high demand and limited resources. AB typically assigns services to specific time slots using an appointment calendar. However, devising an effective AB policy is challenging due to varying service types, durations, and demand variability. In this study, we present a preplanned appointment calendar (PAC), designed using a two-stage stochastic programming model to tackle service scheduling challenges based on demand and historical data. The design of the PAC is generated offline, prior to the arrival of any customers requesting an appointment, and aims to minimize the time from the initial appointment request to service completion, namely, the patient’s sojourn time. Despite the substantial public expenses incurred when appointments are scheduled far in the future, encompassing both indirect costs (e.g., those related to the development of chronic diseases) and direct costs (e.g., those arising from employee absence), the sojourn-time measure has not received sufficient attention in the existing literature. Our method minimizes patients’ sojourn time while considering operational constraints and quality of service (QoS) considerations, resulting in a practical and user-friendly appointment booking system. Our approach is adjustable and easy to apply in real time. We introduce the chained-PAC (CPAC) mechanism, in which multiple, smaller PACs are joined together, and demonstrate the applicability of this approach by implementing it in a cardiac surgical operating room at a major hospital in Toronto, Canada. Results show the PAC approach reduces wait times and improves resource utilization in the surgical unit compared to the existing AB system. Our approach benefits healthcare providers and patients and can extend to other similar service systems.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"201 ","pages":"Article 110931"},"PeriodicalIF":6.5000,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Calendar design for assignment of ongoing appointments: Modeling, analysis and application\",\"authors\":\"Yossi Luzon ,&nbsp;Yariv N. Marmor\",\"doi\":\"10.1016/j.cie.2025.110931\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Appointment booking (AB) is a widely used technique for managing elective services like hospital surgical units, law courtrooms, and other services with high demand and limited resources. AB typically assigns services to specific time slots using an appointment calendar. However, devising an effective AB policy is challenging due to varying service types, durations, and demand variability. In this study, we present a preplanned appointment calendar (PAC), designed using a two-stage stochastic programming model to tackle service scheduling challenges based on demand and historical data. The design of the PAC is generated offline, prior to the arrival of any customers requesting an appointment, and aims to minimize the time from the initial appointment request to service completion, namely, the patient’s sojourn time. Despite the substantial public expenses incurred when appointments are scheduled far in the future, encompassing both indirect costs (e.g., those related to the development of chronic diseases) and direct costs (e.g., those arising from employee absence), the sojourn-time measure has not received sufficient attention in the existing literature. Our method minimizes patients’ sojourn time while considering operational constraints and quality of service (QoS) considerations, resulting in a practical and user-friendly appointment booking system. Our approach is adjustable and easy to apply in real time. We introduce the chained-PAC (CPAC) mechanism, in which multiple, smaller PACs are joined together, and demonstrate the applicability of this approach by implementing it in a cardiac surgical operating room at a major hospital in Toronto, Canada. Results show the PAC approach reduces wait times and improves resource utilization in the surgical unit compared to the existing AB system. Our approach benefits healthcare providers and patients and can extend to other similar service systems.</div></div>\",\"PeriodicalId\":55220,\"journal\":{\"name\":\"Computers & Industrial Engineering\",\"volume\":\"201 \",\"pages\":\"Article 110931\"},\"PeriodicalIF\":6.5000,\"publicationDate\":\"2025-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Industrial Engineering\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0360835225000774\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/2/6 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835225000774","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/6 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

预约(AB)是一种广泛使用的技术,用于管理选择性服务,如医院外科病房、法律法庭和其他高需求和资源有限的服务。AB通常使用约会日历将服务分配到特定的时间段。然而,由于不同的服务类型、持续时间和需求可变性,设计一个有效的AB策略是具有挑战性的。在这项研究中,我们提出了一个预先计划的约会日历(PAC),该日历使用两阶段随机规划模型来解决基于需求和历史数据的服务调度挑战。PAC的设计是离线生成的,在任何请求预约的客户到达之前,旨在最大限度地减少从最初的预约请求到服务完成的时间,即患者的逗留时间。尽管在遥远的未来安排预约会产生大量的公共费用,包括间接费用(例如,与慢性病发展有关的费用)和直接费用(例如,因雇员缺勤引起的费用),但在现有文献中,逗留时间措施没有得到足够的重视。我们的方法在考虑操作限制和服务质量(QoS)因素的同时最大限度地减少了患者的逗留时间,从而形成了一个实用且用户友好的预约系统。我们的方法是可调整的,并且易于实时应用。我们介绍了链式pac (CPAC)机制,其中多个较小的pac连接在一起,并通过在加拿大多伦多一家大医院的心脏外科手术室实施该方法来证明该方法的适用性。结果表明,与现有的AB系统相比,PAC方法减少了等待时间,提高了手术单位的资源利用率。我们的方法有利于医疗保健提供者和患者,并可以扩展到其他类似的服务系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Calendar design for assignment of ongoing appointments: Modeling, analysis and application
Appointment booking (AB) is a widely used technique for managing elective services like hospital surgical units, law courtrooms, and other services with high demand and limited resources. AB typically assigns services to specific time slots using an appointment calendar. However, devising an effective AB policy is challenging due to varying service types, durations, and demand variability. In this study, we present a preplanned appointment calendar (PAC), designed using a two-stage stochastic programming model to tackle service scheduling challenges based on demand and historical data. The design of the PAC is generated offline, prior to the arrival of any customers requesting an appointment, and aims to minimize the time from the initial appointment request to service completion, namely, the patient’s sojourn time. Despite the substantial public expenses incurred when appointments are scheduled far in the future, encompassing both indirect costs (e.g., those related to the development of chronic diseases) and direct costs (e.g., those arising from employee absence), the sojourn-time measure has not received sufficient attention in the existing literature. Our method minimizes patients’ sojourn time while considering operational constraints and quality of service (QoS) considerations, resulting in a practical and user-friendly appointment booking system. Our approach is adjustable and easy to apply in real time. We introduce the chained-PAC (CPAC) mechanism, in which multiple, smaller PACs are joined together, and demonstrate the applicability of this approach by implementing it in a cardiac surgical operating room at a major hospital in Toronto, Canada. Results show the PAC approach reduces wait times and improves resource utilization in the surgical unit compared to the existing AB system. Our approach benefits healthcare providers and patients and can extend to other similar service systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Industrial Engineering
Computers & Industrial Engineering 工程技术-工程:工业
CiteScore
12.70
自引率
12.70%
发文量
794
审稿时长
10.6 months
期刊介绍: Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.
期刊最新文献
Optimization models for medical waste management: Before and during COVID-19 pandemic BuildCES: A conceptual BIM–Blockchain–AI framework for transparent and predictive construction management Joint optimization of inspection scheduling and imperfect maintenance under stochastic repair effects and regime-dependent feasibility Robust optimization for the integrated berth allocation, quay crane assignment, and yard assignment problem Flexible allocation strategy for repetitive project scheduling based on constraint programming
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1