Joint chance-constrained staffing optimization in multi-skill call centers

Tien Thanh Dam, Thuy Anh Ta () and Tien Mai
Additional contact information
Tien Thanh Dam: Phenikaa University
Thuy Anh Ta: Phenikaa University
Tien Mai: Singapore Management University

Journal of Combinatorial Optimization, 2022, vol. 44, issue 1, No 18, 354-378

Abstract: Abstract 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.

Keywords: Call center; Staffing optimization; Joint chance constraint; Cutting plane; Concave-identification (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00830-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:1:d:10.1007_s10878-021-00830-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00830-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().