Optimal Routing Under Demand Surges: The Value of Future Arrival Rates
成果类型:
Article
署名作者:
Chen, Jinsheng; Dong, Jing; Shi, Pengyi
署名单位:
Agency for Science Technology & Research (A*STAR); A*STAR - Singapore Institute of Manufacturing Technology (SIMTech); Columbia University; Purdue University System; Purdue University
刊物名称:
OPERATIONS RESEARCH
ISSN/ISSBN:
0030-364X
DOI:
10.1287/opre.2022.0282
发表日期:
2025
关键词:
maximum pressure policies
convex delay costs
Asymptotic Optimality
emergency-department
process flexibility
parallel servers
call center
QUEUE
performance
principles
摘要:
Motivated by the growing availability of advanced demand forecast tools, we study how to use future demand information in designing routing strategies in queueing sys-tems under demand surges. We consider a parallel server system operating in a nonstation-ary environment with general time-varying arrival rates. Servers are cross-trained to help nonprimary customer classes during demand surges. However, such flexibility comes with various operational costs, such as a loss of efficiency and inconvenience in coordination. We characterize how to incorporate the future arrival information into the routing policy to bal-ance the tradeoff between various costs and quantify the benefit of doing so. Based on tran-sient fluid control analysis, we develop a two-stage index-based look-ahead policy that explicitly takes the overflow costs and future arrival rates into account. The policy has an interpretable structure, is easy to implement and is adaptive when the future arrival informa-tion is inaccurate. In the special case of the N-model, we prove that this policy is asymptoti-cally optimal even in the presence of certain prediction errors in the demand forecast. We substantiate our theoretical analysis with extensive numerical experiments, showing that our policy achieves superior performance compared with other benchmark policies (i) in compli-cated parallel server systems and (ii) when the demand forecast is imperfect with various forms of prediction errors.