Robust Appointment Scheduling with Waiting Time Guarantees

计算机科学 调度(生产过程) 数学优化 分布式计算 运筹学 实时计算 数学
作者
Carolin Bauerhenne,Rainer Kolisch,Andreas S. Schulz
出处
期刊:Manufacturing & Service Operations Management [Institute for Operations Research and the Management Sciences]
卷期号:28 (3): 995-1009 被引量:10
标识
DOI:10.1287/msom.2024.0852
摘要

Problem definition: Appointment scheduling problems under uncertainty encounter a fundamental trade-off between cost minimization and customer waiting times. Most existing studies address this trade-off using a weighted sum approach, which puts little emphasis on individual waiting times and, thus, customer satisfaction. In contrast, we study how to minimize total cost while providing waiting time guarantees to all customers. Methodology/results: Given box uncertainty sets for service times and no-shows, we introduce the robust appointment scheduling problem with waiting time guarantees. We show that the problem is [Formula: see text]-hard in general and introduce a mixed-integer linear program that can be solved in reasonable computation time. For special cases, we prove that polynomial-time variants of the well-known smallest-variance-first sequencing rule and the Bailey–Welch scheduling rule are optimal. Furthermore, a case study with data from the radiology department of a large university hospital demonstrates that the approach not only guarantees acceptable waiting times but, compared with existing robust approaches, may simultaneously reduce costs incurred by idle time and overtime. Managerial implications: This work suggests that limiting instead of minimizing customer waiting times is a win–win solution in the trade-off between customer satisfaction and cost minimization. Additionally, it provides an easy-to-implement and customizable appointment scheduling framework with waiting time guarantees. Funding: This work was supported by the Deutsche Forschungsgemeinschaft [Grant 277991500/GRK2201]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2024.0852 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
好好睡觉发布了新的文献求助10
刚刚
刚刚
刚刚
Ava的应助被小鱼采纳,获得10
1秒前
momo发布了新的文献求助10
1秒前
1秒前
科研通AI6.3的应助被牧百川采纳,获得10
1秒前
2秒前
zhizhi发布了新的文献求助10
3秒前
lxl完成签到 ,获得积分10
3秒前
3秒前
DW的应助被dennis采纳,获得10
3秒前
zhang完成签到,获得积分10
3秒前
奶茶电竞精神完成签到 ,获得积分10
3秒前
4秒前
水煮电吹风的应助被cc采纳,获得10
4秒前
lXQ完成签到,获得积分10
5秒前
ASA完成签到,获得积分10
5秒前
5秒前
坚强孤容发布了新的文献求助10
5秒前
魔幻灯泡完成签到,获得积分10
5秒前
orixero的应助被777采纳,获得10
6秒前
6秒前
甜蜜巧曼发布了新的文献求助10
6秒前
6秒前
7秒前
klicking完成签到,获得积分10
7秒前
Maestro_S的应助被大意的凝芙采纳,获得10
7秒前
踏实访琴发布了新的文献求助10
8秒前
8秒前
势不可挡完成签到,获得积分10
8秒前
忘崽子小拳头完成签到,获得积分10
9秒前
9秒前
9秒前
ding的应助被silin采纳,获得10
9秒前
朝菌发布了新的文献求助10
9秒前
9秒前
10秒前
哈哈发布了新的文献求助10
10秒前
10秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
八旗制度の研究 600
Boundaries and Bodhisattvas 500
高分子基功能界面水蒸发材料与应用研究 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8182977
求助须知:如何正确求助?哪些是违规求助? 9572322
关于积分的说明 21824168
捐赠科研通 7779612
什么是DOI,文献DOI怎么找? 3433774
关于科研通互助平台的介绍 2558024
邀请新用户注册赠送积分活动 2479971