首页> 外文会议>2012 IEEE International Conference on Service Operations and Logistics, and Informatics >Proficiency based agent scheduling to maximize infrastructure utilization in call-centers
【24h】

Proficiency based agent scheduling to maximize infrastructure utilization in call-centers

机译:基于能力的座席调度,可最大化呼叫中心的基础架构利用率

获取原文
获取原文并翻译 | 示例

摘要

We consider the issue of call-center scheduling coupled with capacity planning of both service agents (servers) and physical seats (space) in an environment where call arrival rates are highly variable and the call center is subjected to a global service level constraint. The paper is motivated by the work with the business process outsourcing unit providing technical support services from growth markets like India where real-estate is one of the major cost drivers along with human capital. Our paper has two distinctive features. Firstly, we model capacity planning problem for seats and scheduling of agents as one single optimization problem leveraging variable service rates of human agents; information which is ignored by workforce planning teams while modeling. Secondly, we formulate the problem as a mixed integer linear programming (MILP) problem which is not trivial given the non-linear nature of service level constraint. We show that the set of linear inequalities required to represent service level constraint for each period can be generated cheaply. We conduct extensive experimentation to compare solutions of the MILP formulation recognizing variability in service rate with the traditional formulation based on mean valued service rates. We find that, in general, our formulation provides a significant reduction in space requirement and the solution minimizes the over-achievement of service level requirement.
机译:我们考虑呼叫中心调度的问题,以及在呼叫到达率高度可变且呼叫中心受到全局服务级别约束的环境中,服务代理(服务器)和物理座位(空间)的容量规划的问题。本文的动机是与业务流程外包部门的合作提供的,该部门从诸如印度这样的增长市场提供技术支持服务,在印度,房地产是人力成本的主要驱动因素之一。我们的论文有两个鲜明的特点。首先,我们将席位的容量规划问题和代理商的调度建模为一个单一的优化问题,利用人员代理的可变服务费率;劳动力规划团队在建模时会忽略的信息。其次,我们将问题表述为混合整数线性规划(MILP)问题,考虑到服务水平约束的非线性性质,该问题并不简单。我们表明,代表每个周期的服务水平约束所需的线性不等式集合可以廉价地生成。我们进行了广泛的实验,以比较MILP配方的解决方案,该解决方案基于平均价值服务率将服务率变化与传统配方进行比较。我们发现,总的来说,我们的公式可以大大减少空间需求,并且该解决方案可以最大程度地减少对服务水平要求的过度实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号