Joint chance-constrained staffing optimization in multi-skill call centers
This paper concerns the staffing optimization problem in multi-skill call centers. The objective is to find a minimal cost staffing solution while meeting a target level for the quality of service (QoS) to customers. We consider a staffing problem in which joint chance constraints are imposed on the...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2022
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/6954 https://ink.library.smu.edu.sg/context/sis_research/article/7957/viewcontent/JointChance_constrained_av.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-7957 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-79572024-03-20T05:11:01Z Joint chance-constrained staffing optimization in multi-skill call centers DAM, Tien Thanh TA, Thuy Anh MAI, Tien This paper concerns the staffing optimization problem in multi-skill call centers. The objective is to find a minimal cost staffing solution while meeting a target level for the quality of service (QoS) to customers. We consider a staffing problem in which joint chance constraints are imposed on the QoS of the day. Our joint chance-constrained formulation is more rational capturing the correlation between different call types, as compared to separate chance-constrained versions considered in previous studies. We show that, in general, the probability functions in the joint-chance constraints display S-shaped curves, and the optimal solutions should belong to the concave regions of the curves. Thus, we propose an approach combining a heuristic phase to identify solutions lying in the concave part and a simulation-based cut generation phase to create outer-approximations of the probability functions. This allows us to find good staffing solutions satisfying the joint-chance constraints by simulation and linear programming. We test our formulation and algorithm using call center examples of up to 65 call types and 89 agent groups, which shows the benefits of our joint-chance constrained formulation and the advantage of our algorithm over standard ones. 2022-08-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/6954 info:doi/10.1007/s10878-021-00830-1 https://ink.library.smu.edu.sg/context/sis_research/article/7957/viewcontent/JointChance_constrained_av.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Call center Staffing optimization Joint chance constraint Cutting plane Concave-identification Artificial Intelligence and Robotics Operations and Supply Chain Management Operations Research, Systems Engineering and Industrial Engineering |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Call center Staffing optimization Joint chance constraint Cutting plane Concave-identification Artificial Intelligence and Robotics Operations and Supply Chain Management Operations Research, Systems Engineering and Industrial Engineering |
spellingShingle |
Call center Staffing optimization Joint chance constraint Cutting plane Concave-identification Artificial Intelligence and Robotics Operations and Supply Chain Management Operations Research, Systems Engineering and Industrial Engineering DAM, Tien Thanh TA, Thuy Anh MAI, Tien Joint chance-constrained staffing optimization in multi-skill call centers |
description |
This paper concerns the staffing optimization problem in multi-skill call centers. The objective is to find a minimal cost staffing solution while meeting a target level for the quality of service (QoS) to customers. We consider a staffing problem in which joint chance constraints are imposed on the QoS of the day. Our joint chance-constrained formulation is more rational capturing the correlation between different call types, as compared to separate chance-constrained versions considered in previous studies. We show that, in general, the probability functions in the joint-chance constraints display S-shaped curves, and the optimal solutions should belong to the concave regions of the curves. Thus, we propose an approach combining a heuristic phase to identify solutions lying in the concave part and a simulation-based cut generation phase to create outer-approximations of the probability functions. This allows us to find good staffing solutions satisfying the joint-chance constraints by simulation and linear programming. We test our formulation and algorithm using call center examples of up to 65 call types and 89 agent groups, which shows the benefits of our joint-chance constrained formulation and the advantage of our algorithm over standard ones. |
format |
text |
author |
DAM, Tien Thanh TA, Thuy Anh MAI, Tien |
author_facet |
DAM, Tien Thanh TA, Thuy Anh MAI, Tien |
author_sort |
DAM, Tien Thanh |
title |
Joint chance-constrained staffing optimization in multi-skill call centers |
title_short |
Joint chance-constrained staffing optimization in multi-skill call centers |
title_full |
Joint chance-constrained staffing optimization in multi-skill call centers |
title_fullStr |
Joint chance-constrained staffing optimization in multi-skill call centers |
title_full_unstemmed |
Joint chance-constrained staffing optimization in multi-skill call centers |
title_sort |
joint chance-constrained staffing optimization in multi-skill call centers |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2022 |
url |
https://ink.library.smu.edu.sg/sis_research/6954 https://ink.library.smu.edu.sg/context/sis_research/article/7957/viewcontent/JointChance_constrained_av.pdf |
_version_ |
1794549873940365312 |