Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach

被引:67
|
作者
Gurvich, Itai [1 ]
Luedtke, James [2 ]
Tezcan, Tolga [3 ]
机构
[1] Northwestern Univ, Kellogg Sch Management, Evanston, IL 60208 USA
[2] Univ Wisconsin, Madison, WI 53706 USA
[3] Univ Illinois, Urbana, IL 61801 USA
关键词
call centers; chance-constrained optimization; queueing; SERVICE-LEVEL DIFFERENTIATION; DISCRETE-DISTRIBUTIONS; TIME-SERIES; SYSTEMS;
D O I
10.1287/mnsc.1100.1173
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the problem of staffing call centers with multiple customer classes and agent types operating under quality-of-service (QoS) constraints and demand rate uncertainty. We introduce a formulation of the staffing problem that requires that the QoS constraints are met with high probability with respect to the uncertainty in the demand rate. We contrast this chance-constrained formulation with the average-performance constraints that have been used so far in the literature. We then propose a two-step solution for the staffing problem under chance constraints. In the first step, we introduce a random static planning problem (RSPP) and discuss how it can be solved using two different methods. The RSPP provides us with a first-order (or fluid) approximation for the true optimal staffing levels and a staffing frontier. In the second step, we solve a finite number of staffing problems with known arrival rates-the arrival rates on the optimal staffing frontier. Hence, our formulation and solution approach has the important property that it translates the problem with uncertain demand rates to one with known arrival rates. The output of our procedure is a solution that is feasible with respect to the chance constraint and nearly optimal for large call centers.
引用
收藏
页码:1093 / 1115
页数:23
相关论文
共 50 条
  • [21] An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
    Bai, Xiaodi
    Sun, Jie
    Zheng, Xiaojin
    INFORMS JOURNAL ON COMPUTING, 2021, 33 (03) : 1056 - 1069
  • [22] Chance-Constrained Optimization for Refinery Blend Planning under Uncertainty
    Yang, Yu
    Vayanos, Phebe
    Barton, Paul I.
    INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2017, 56 (42) : 12139 - 12150
  • [23] Uncertainty Analysis for Data-Driven Chance-Constrained Optimization
    Haeussling Loewgren, Bartolomeus
    Weigert, Joris
    Esche, Erik
    Repke, Jens-Uwe
    SUSTAINABILITY, 2020, 12 (06)
  • [24] GENERATION OF DATA-DRIVEN MODELS FOR CHANCE-CONSTRAINED OPTIMIZATION
    Weigert, J.
    Esche, E.
    Hoffmann, C.
    Repke, J. -U.
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON FOUNDATIONS OF COMPUTER-AIDED PROCESS DESIGN, 2019, 47 : 311 - 316
  • [25] Combinatorial chance-constrained economic optimization of distributed energy resources
    Sager, Jens
    Nieße, Astrid
    Energy Informatics, 2024, 7 (01)
  • [26] Chance-constrained UAM traffic flow optimization with fast disruption recovery under uncertain waypoint occupancy time
    Pang, Bizhao
    Low, Kin Huat
    Duong, Vu N.
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2024, 161
  • [27] Chance-constrained admission scheduling of elective surgical patients in a dynamic, uncertain setting
    Vancroonenburg, Wim
    De Causmaecker, Patrick
    Vanden Berghe, Greet
    OPERATIONS RESEARCH FOR HEALTH CARE, 2019, 22
  • [28] Closed-loop supply chain network design with price-greenness-sensitive demand: A distributionally robust chance-constrained optimization approach
    Gao, Yao
    Lu, Shaojun
    Zhan, Sheng
    Hu, Chaoming
    Liu, Xinbao
    COMPUTERS & OPERATIONS RESEARCH, 2024, 172
  • [29] Active Exploration by Chance-Constrained Optimization for Voltage Regulation with Reinforcement Learning
    Ding, Zhenhuan
    Huang, Xiaoge
    Liu, Zhao
    ENERGIES, 2022, 15 (02)
  • [30] Inner Moreau Envelope of Nonsmooth Conic Chance-Constrained Optimization Problems
    van Ackooij, Wim
    Perez-Aros, Pedro
    Soto, Claudia
    Vilches, Emilio
    MATHEMATICS OF OPERATIONS RESEARCH, 2024, 49 (03) : 1419 - 1451