主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2021, Vol. 29 ›› Issue (4): 169-178.doi: 10.16381/j.cnki.issn1003-207x.2018.1046

• Articles • Previous Articles     Next Articles

Modeling and Algorithm for a Monthly Shift Scheduling and Rostering Problem in Small-Size Call Centers

WANG Xiu-li, XU Yue, HU Xiu-wu   

  1. School of Economics and Management, Nanjing University of Science and Technology, Nanjing 210094, China
  • Received:2018-07-25 Revised:2020-05-28 Published:2021-04-25

Abstract: In order to effectively manage human resources, small and medium-sized call centers in China usually work out monthly schedule schemes for agents. The problem under study is how to determine on/off duty dates of agents in the month and how to assign shifts to agents with the constraints of various enterprise employment regulations and the service level, so as to minimize the number of the on duty agents (i.e. optimize the cost of manpower), while keeping the shifts of each agent in the week as same as possible. A quadratic integer programming model of the problem is constructed. Considering the intractability of the model, the problem is decomposed into three sub-problems based on enterprise demands and logical analysis of the model structure. The subproblems are solved by either integer programming models or heuristic algorithm, to generate optimal solutions. The computational results show that the proposed models and heuristic algorithm can control manpower cost and meet the demands for same shift management effectively. Compared with existing weekly scheduling methods, this method can fully exploit the monthly manpower flexibility to achieve good effect on human resource allocation. The research scenario of this paper comes from a practical call center in China. The proposed model and algorithm can be used for inspiration to solve various scheduling problems in small and medium-sized call center enterprises.

Key words: call center, monthly scheduling and rostering, integer programming, heuristic

CLC Number: