Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 57, No. 3, May-June 2009, pp. 714-726
DOI: 10.1287/opre.1080.0602
This Article
Right arrow Full Text (PDF)
Right arrow e-companion
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Bassamboo, A.
Right arrow Articles by Zeevi, A.
Right arrow Search for Related Content

On a Data-Driven Method for Staffing Large Call Centers

Achal Bassamboo, Assaf Zeevi

Kellogg School of Management, Northwestern University, Evanston, Illinois 60208
Graduate School of Business, Columbia University, New York, New York 10027

a-bassamboo{at}northwestern.edu
assaf{at}gsb.columbia.edu

We consider a call center model with multiple customer classes and multiple server pools. Calls arrive randomly over time, and the instantaneous arrival rates are allowed to vary both temporally and stochastically in an arbitrary manner. The objective is to minimize the sum of personnel costs and expected abandonment penalties by selecting an appropriate staffing level for each server pool. We propose a simple and computationally tractable method for solving this problem that requires as input only a few system parameters and historical call arrival data for each customer class; in this sense the method is said to be data-driven. The efficacy of the proposed method is illustrated via numerical examples. An asymptotic analysis establishes that the prescribed staffing levels achieve near-optimal performance and characterizes the magnitude of the optimality gap.

Subject classifications: stochastic model applications; stochastic networks; nonstationary queues; limit theorem; approximations.
History: Received May 2006; revision received February 2008; accepted March 2008.




This article has been cited by other articles:


Home page
Management ScienceHome page
O. Perry and W. Whitt
Responding to Unexpected Overloads in Large-Scale Service Systems
Management Science, August 1, 2009; 55(8): 1353 - 1367.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2009 by INFORMS.