首页 | 本学科首页   官方微博 | 高级检索  
     检索      

考虑休班公平及同班次约束的呼叫中心排班优化问题
引用本文:胡修武,徐悦,王秀利.考虑休班公平及同班次约束的呼叫中心排班优化问题[J].系统工程学报,2021(1):88-101.
作者姓名:胡修武  徐悦  王秀利
作者单位:南京理工大学经济管理学院
基金项目:国家自然科学基金资助项目(71871118;71571101).
摘    要:国内呼叫中心企业制定人力排班表时,越来越关注员工诉求及体现人性化管理理念.考虑坐席人员双休日休班公平性和周内工作日上班时间规律性,构建以多周为计划周期的呼叫中心排班优化问题整数规划模型.在对问题结构和优化性质分析基础上,提出构造性启发式算法.使用企业实例数据对模型和算法性能进行评估.计算结果表明规划模型只适于求解小规模问题最优解,而启发式算法能够以小计算成本获得较大规模问题优化解.最后计算分析得出了这些员工诉求因素对排班人力成本影响的量化结果.

关 键 词:呼叫中心  人员排班  整数规划  启发式算法

Shift scheduling and rostering problem of call centers considering off-day fairness and same shift constraints
Hu Xiuwu,Xu Yue,Wang Xiuli.Shift scheduling and rostering problem of call centers considering off-day fairness and same shift constraints[J].Journal of Systems Engineering,2021(1):88-101.
Authors:Hu Xiuwu  Xu Yue  Wang Xiuli
Institution:(School of Economics and Management,Nanjing University of Science and Technology,Nanjing 210094,China)
Abstract:Call centers are paying more and more attention to agent appeals and humanized management when formulating personnel scheduling tables.Considering the fairness of weekend off and the regularity of workdays,an integer programming model for the shift scheduling and rostering problem with multi-week planning period is constructed.Based on the analysis of problem structure and optimization properties,a constructive heuristic algorithm is proposed.Model and algorithm performance is evaluated with enterprise actual data.Experimental results show that the integer programming model is only suitable for achieving the optimal solutions of small-scale problems,while the heuristic algorithm can obtain the(sub-)optimal solutions of large-scale problems with small computational cost.Calculations are given to illustrate the quantitative impacts of these agents’demands on labor cost of call centers.
Keywords:call center  shift scheduling and rostering  integer program  heuristic algorithm
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号