|
|
||||||||
Graduate School of Business, Stanford University, 518 Memorial Way, Stanford, California 94305
We consider a call center model with m input flows and r pools of agents; the m-vector
Graduate School of Business, Columbia University, 3022 Broadway, New York, New York 10027
harrison_michael{at}gsb.stanford.edu
assaf{at}gsb.columbia.edu
of instantaneous arrival rates is allowed to be time dependent and to vary stochastically. Seeking to optimize the trade-off between personnel costs and abandonment penalties, we develop and illustrate a practical method for sizing the r agent pools. Using stochastic fluid models, this method reduces the staffing problem to a multidimensional newsvendor problem, which can be solved numerically by a combination of linear programming and Monte Carlo simulation. Numerical examples are presented, and in all cases the pool sizes derived by means of the proposed method are very close to optimal.
History: Received: September 25, 2003;
accepted: May 9, 2004.
This article has been cited by other articles:
![]() |
A. Mandelbaum and S. Zeltyn Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers Operations Research, September 1, 2009; 57(5): 1189 - 1205. [Abstract] [PDF] |
||||
![]() |
A. Bassamboo and A. Zeevi On a Data-Driven Method for Staffing Large Call Centers Operations Research, May 1, 2009; 57(3): 714 - 726. [Abstract] [PDF] |
||||
![]() |
C. W. Chan and V. F. Farias Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems Mathematics of Operations Research, May 1, 2009; 34(2): 333 - 350. [Abstract] [PDF] |
||||
![]() |
Z. G. Zhang Performance Analysis of a Queue with Congestion-Based Staffing Policy Management Science, February 1, 2009; 55(2): 240 - 251. [Abstract] [PDF] |
||||
![]() |
M. Armony, E. Plambeck, and S. Seshadri Sensitivity of Optimal Capacity to Customer Impatience in an Unobservable M/M/S Queue (Why You Shouldn't Shout at the DMV) MSOM, January 1, 2009; 11(1): 19 - 32. [Abstract] [PDF] |
||||
![]() |
A. Bassamboo, J. M. Harrison, and A. Zeevi Pointwise Stationary Fluid Models for Stochastic Processing Networks MSOM, January 1, 2009; 11(1): 70 - 89. [Abstract] [PDF] |
||||
![]() |
I. Gurvich, M. Armony, and A. Mandelbaum Service-Level Differentiation in Call Centers with Fully Flexible Servers Management Science, February 1, 2008; 54(2): 279 - 294. [Abstract] [PDF] |
||||
![]() |
O. Z. Aksin, F. de Vericourt, and F. Karaesmen Call Center Outsourcing Contract Analysis and Choice Management Science, February 1, 2008; 54(2): 354 - 368. [Abstract] [PDF] |
||||
![]() |
Z. J. Ren and Y.-P. Zhou Call Center Outsourcing: Coordinating Staffing Level and Service Quality Management Science, February 1, 2008; 54(2): 369 - 383. [Abstract] [PDF] |
||||
![]() |
F. de Vericourt and O. B. Jennings Dimensioning Large-Scale Membership Services Operations Research, January 1, 2008; 56(1): 173 - 187. [Abstract] [PDF] |
||||
![]() |
M. F. Keblis and M. Chen Improving Customer Service Operations at Amazon.com Interfaces, September 1, 2006; 36(5): 433 - 445. [Abstract] [PDF] |
||||
![]() |
A. Bassamboo, J. M. Harrison, and A. Zeevi Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method Operations Research, May 1, 2006; 54(3): 419 - 435. [Abstract] [PDF] |
||||
![]() |
R. B. Wallace and W. Whitt A Staffing Algorithm for Call Centers with Skill-Based Routing MSOM, January 1, 2005; 7(4): 276 - 294. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |