人员配备
启发式
排队论
计算机科学
数学优化
服务(商务)
正确性
运筹学
剖切面法
运营管理
数学
算法
计算机网络
工程类
整数规划
经济
经济
管理
作者
Júlíus Atlason,Marina A. Epelman,Shane G. Henderson
出处
期刊:Management Science
[Institute for Operations Research and the Management Sciences]
日期:2007-12-12
卷期号:54 (2): 295-309
被引量:156
标识
DOI:10.1287/mnsc.1070.0774
摘要
We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicated by the fact that staffing level in one time period can affect the service levels in subsequent periods. Moreover, staff schedules typically take the form of shifts covering several periods. Interactions between staffing levels in different time periods, as well as the impact of shift requirements on the staffing levels and cost, should be considered in the planning. Traditional staffing methods based on stationary queueing formulas do not take this into account. We present a simulation-based analytic center cutting-plane method to solve a sample average approximation of the problem. We establish convergence of the method when the service-level functions are discrete pseudoconcave. An extensive numerical study of a moderately large call center shows that the method is robust and, in most of the test cases, outperforms traditional staffing heuristics that are based on analytical queueing methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI