An Exact and Efficient Algorithm for the Constrained Dynamic Operator Staffing Problem for Call Centers
Authors:
- 1 February 2008
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 54 (2) , 339-353
Abstract
Call center managers are facing increasing pressure to reduce costs while maintaining acceptable service quality. Consequently, they often face constrained stochastic optimization problems, minimizing cost subject to service-level constraints. Complicating this problem is the fact that customer-arrival rates to call centers are often time varying. Thus, to satisfy their service goals in a cost-effective manner, call centers may employ permanent operators who always provide service, and temporary operators who provide service only when the call center is busy, i.e., when the number of customers in system increases beyond a threshold level. This provides flexibility to dynamically adjust the number of operators providing service in response to the time-varying arrival rate. The constrained dynamic operator staffing (CDOS) problem involves determining the number of permanent and temporary operators, and the threshold value(s) that minimize time-average hiring and opportunity costs subject to service-level constraints. We model the CDOS problem as a constrained Markov decision process (MDP) and seek the optimal nonrandomized policy. The only exact method in the literature to obtain the optimal nonrandomized policy for a constrained MDP is enumeration, which is often computationally prohibitive. We provide a novel exact and efficient solution method, the modified balance equations disjunctive constraints (MBEDC) algorithm, yielding a mixed-integer program formulation; the computation times of this algorithm for sample problems are lower than enumeration by up to a factor of 200, and by a factor of 10 on average. Using our algorithm, we quickly solve diverse instances of the CDOS problem, generating managerial insights into the effects of temporary operators and service-level constraints.Keywords
This publication has 17 references indexed in Scilit:
- Multi-item spare parts systems with lateral transshipments and waiting time constraintsEuropean Journal of Operational Research, 2006
- Robustness of threshold policies in beneficiary-donor modelACM SIGMETRICS Performance Evaluation Review, 2005
- The BMAP/G/1 queue: A tutorial2005
- Telephone Call Centers: Tutorial, Review, and Research ProspectsManufacturing & Service Operations Management, 2003
- Necessary and Sufficient Conditions for Representing General Distributions by CoxiansLecture Notes in Computer Science, 2003
- Managing uncertainty in call centres using Poisson mixturesApplied Stochastic Models in Business and Industry, 2001
- Dynamic staffing in a telephone call center aiming to immediately answer all callsOperations Research Letters, 1999
- Disjunctive programming: Properties of the convex hull of feasible pointsDiscrete Applied Mathematics, 1998
- Comparing Policies in Markov Decision Processes: Mandl's Lemma RevisitedMathematics of Operations Research, 1990
- Optimal priority assignment with hard constraintIEEE Transactions on Automatic Control, 1986