Appointment scheduling and the effects of customer congestion on service

被引:6
|
作者
Zhang, Zheng [1 ]
Berg, Bjorn P. [2 ]
Denton, Brian T. [1 ]
Xie, Xiaolan [3 ,4 ]
机构
[1] Univ Michigan, Dept Ind & Operat Engn, Ann Arbor, MI 48109 USA
[2] Univ Minnesota, Div Hlth Policy & Management, Minneapolis, MN USA
[3] Shanghai Jiao Tong Univ, Antai Coll Econ & Management, Shanghai, Peoples R China
[4] Univ Clermont Auvergne, Mines St Etienne, CNRS, UMR 6158 LIMOS,Ctr CIS, F-42023 St Etienne, France
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
Appointment scheduling; server behavior; optimization; SIMULATION-BASED OPTIMIZATION; HEALTH-CARE; NO-SHOWS; SYSTEMS; QUEUES; SERVER; REVENUE; MODEL;
D O I
10.1080/24725854.2018.1562590
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This article addresses an appointment scheduling problem in which the server responds to congestion of the service system. Using waiting time as a proxy for how far behind schedule the server is running, we characterize the congestion-induced behavior of the server as a function of a customer's waiting time. Decision variables are the scheduled arrival times for a specific sequence of customers. The objective of our model is to minimize a weighted cost incurred for a customer's waiting time, server overtime and server speedup in response to congestion. We provide alternative formulations of this problem as a Simulation Optimization (SO) model and a Stochastic Integer Programming (SIP) model, respectively. We show that the SIP model can solve moderate-sized instances exactly under certain assumptions about a servers response to congestion. We further show that the SO model achieves near-optimal solutions for moderate-sized problems while also being able to scale up to much larger problem instances. We present theoretical results for both models and we carry out a series of experiments to illustrate the characteristics of the optimal schedules and to measure the importance of accounting for a servers response to congestion when scheduling appointments using a case study for an outpatient clinic at a large medical center. Finally, we summarize the most important managerial insights obtained from this study.
引用
收藏
页码:1075 / 1090
页数:16
相关论文
共 50 条
  • [21] A Computational approach to optimized appointment scheduling
    Kuiper, Alex
    Kemper, Benjamin
    Mandjes, Michel
    QUEUEING SYSTEMS, 2015, 79 (01) : 5 - 36
  • [22] Adaptive appointment scheduling with periodic updates
    Mahes, Roshan
    Mandjes, Michel
    Boon, Marko
    COMPUTERS & OPERATIONS RESEARCH, 2024, 161
  • [23] Appointment Scheduling with No-Shows and Overbooking
    Zacharias, Christos
    Pinedo, Michael
    PRODUCTION AND OPERATIONS MANAGEMENT, 2014, 23 (05) : 788 - 801
  • [24] Outpatient appointment scheduling with unpunctual patients
    Zhu, Han
    Chen, Youhua
    Leung, Eman
    Liu, Xing
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (05) : 1982 - 2002
  • [25] Sequencing and scheduling appointments on multiple servers with stochastic service durations and customer arrivals
    Wu, Xueqi
    Zhou, Shenghai
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2022, 106
  • [26] Optimized appointment scheduling
    Kemper, Benjamin
    Klaassen, Chris A. J.
    Mandjes, Michel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 239 (01) : 243 - 255
  • [27] Two-day appointment scheduling with patient preferences and geometric arrivals
    Zhang, Yu
    Kulkarni, Vidyadhar G.
    QUEUEING SYSTEMS, 2017, 85 (1-2) : 173 - 209
  • [28] Appointment scheduling and real-time sequencing strategies for patient unpunctuality
    Pan, Xingwei
    Geng, Na
    Xie, Xiaolan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 295 (01) : 246 - 260
  • [29] An adaptive decision support system for outpatient appointment scheduling with heterogeneous service times
    Feng, Haolin
    Jia, Yiwu
    Huang, Teng
    Zhou, Siyi
    Chen, Hongyi
    SCIENTIFIC REPORTS, 2024, 14 (01):
  • [30] Nonsequential Appointment Scheduling With a Random Number of Requests
    Zhu, Yan
    Liu, Zhixin
    Qi, Xiangtong
    PRODUCTION AND OPERATIONS MANAGEMENT, 2024, 33 (01) : 184 - 204