IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v5y2003i2d10.1023_a1024501601020.html
   My bibliography  Save this article

Models and Approximations for Call Center Design

Author

Listed:
  • David L. Jagerman

    (Rutgers University)

  • Benjamin Melamed

    (Rutgers University)

Abstract

A call center is a facility for delivering telephone service, both incoming and outgoing. This paper addresses optimal staffing of call centers, modeled as M/G/n queues whose offered traffic consists of multiple customer streams, each with an individual priority, arrival rate, service distribution and grade of service (GoS) stated in terms of equilibrium tail waiting time probabilities or mean waiting times. The paper proposes a methodology for deriving the approximate minimal number of servers that suffices to guarantee the prescribed GoS of all customer streams. The methodology is based on an analytic approximation, called the Scaling-Erlang (SE) approximation, which maps the M/G/n queue to an approximating, suitably scaled M/G/1 queue, for which waiting time statistics are available via the Pollaczek-Khintchine formula in terms of Laplace transforms. The SE approximation is then generalized to M/G/n queues with multiple types of customers and non-preemptive priorities, yielding the Priority Scaling-Erlang (PSE) approximation. A simple goal-seeking search, utilizing SE/PSE approximations, is presented for the optimal staffing level, subject to GoS constraints. The efficacy of the methodology is demonstrated by comparing the number of servers estimated via the PSE approximation to their counterparts obtained by simulation. A number of case studies confirm that the SE/PSE approximations yield optimal staffing results in excellent agreement with simulation, but at a fraction of simulation time and space.

Suggested Citation

  • David L. Jagerman & Benjamin Melamed, 2003. "Models and Approximations for Call Center Design," Methodology and Computing in Applied Probability, Springer, vol. 5(2), pages 159-181, June.
    • Handle: RePEc:spr:metcap:v:5:y:2003:i:2:d:10.1023_a:1024501601020
    DOI: 10.1023/A:1024501601020
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1024501601020
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1024501601020?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Per Hokstad, 1978. "Approximations for the M / G / m Queue," Operations Research, INFORMS, vol. 26(3), pages 510-523, June.
    2. Benjamin Melamed & Ward Whitt, 1990. "On Arrivals That See Time Averages," Operations Research, INFORMS, vol. 38(1), pages 156-172, February.
    3. David Y. Sze, 1984. "OR Practice—A Queueing Model for Telephone Operator Staffing," Operations Research, INFORMS, vol. 32(2), pages 229-249, April.
    4. Ward Whitt, 1999. "Improving Service by Informing Customers About Anticipated Delays," Management Science, INFORMS, vol. 45(2), pages 192-207, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gökçe Kahveciog̃lu & Barış Balcıog̃lu, 2016. "Coping with production time variability via dynamic lead-time quotation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 877-898, October.
    2. A. Baykal Hafızoğlu & Esma S. Gel & Pınar Keskinocak, 2013. "Expected Tardiness Computations in Multiclass Priority M / M / c Queues," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 364-376, May.
    3. Wei Xiong & Tayfur Altiok, 2009. "An approximation for multi-server queues with deterministic reneging times," Annals of Operations Research, Springer, vol. 172(1), pages 143-151, November.
    4. Sheridan, Patricia Kristine & Gluck, Erich & Guan, Qi & Pickles, Thomas & Balcıog˜lu, Barış & Benhabib, Beno, 2013. "The dynamic nearest neighbor policy for the multi-vehicle pick-up and delivery problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 49(C), pages 178-194.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tetsuji Hirayama, 2003. "Mean sojourn times in multiclass feedback queues with gated disciplines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 719-741, October.
    2. Rouba Ibrahim & Mor Armony & Achal Bassamboo, 2017. "Does the Past Predict the Future? The Case of Delay Announcements in Service Systems," Management Science, INFORMS, vol. 63(6), pages 1762-1780, June.
    3. Rouba Ibrahim & Ward Whitt, 2011. "Wait-Time Predictors for Customer Service Systems with Time-Varying Demand and Capacity," Operations Research, INFORMS, vol. 59(5), pages 1106-1118, October.
    4. Qiuping Yu & Gad Allon & Achal Bassamboo & Seyed Iravani, 2018. "Managing Customer Expectations and Priorities in Service Systems," Management Science, INFORMS, vol. 64(8), pages 3942-3970, August.
    5. Delasay, Mohammad & Ingolfsson, Armann & Kolfal, Bora & Schultz, Kenneth, 2019. "Load effect on service times," European Journal of Operational Research, Elsevier, vol. 279(3), pages 673-686.
    6. Hassin, Refael & Haviv, Moshe & Oz, Binyamin, 2023. "Strategic behavior in queues with arrival rate uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 217-224.
    7. Pengfei Guo & Paul Zipkin, 2007. "Analysis and Comparison of Queues with Different Levels of Delay Information," Management Science, INFORMS, vol. 53(6), pages 962-970, June.
    8. Jouini, Oualid & Dallery, Yves & Aksin, Zeynep, 2009. "Queueing models for full-flexible multi-class call centers with real-time anticipated delays," International Journal of Production Economics, Elsevier, vol. 120(2), pages 389-399, August.
    9. Pengfei Guo & Zhe George Zhang, 2013. "Strategic Queueing Behavior and Its Impact on System Performance in Service Systems with the Congestion-Based Staffing Policy," Manufacturing & Service Operations Management, INFORMS, vol. 15(1), pages 118-131, September.
    10. Qiuping Yu & Gad Allon & Achal Bassamboo, 2017. "How Do Delay Announcements Shape Customer Behavior? An Empirical Study," Management Science, INFORMS, vol. 63(1), pages 1-20, January.
    11. Chester Chambers & Panagiotis Kouvelis, 2006. "Modeling and Managing the Percentage of Satisfied Customers in Hidden and Revealed Waiting Line Systems," Production and Operations Management, Production and Operations Management Society, vol. 15(1), pages 103-116, March.
    12. Oualid Jouini & Zeynep Akşin & Yves Dallery, 2011. "Call Centers with Delay Information: Models and Insights," Manufacturing & Service Operations Management, INFORMS, vol. 13(4), pages 534-548, October.
    13. Siddharth Prakash Singh & Mohammad Delasay & Alan Scheller‐Wolf, 2023. "Real‐time delay announcement under competition," Production and Operations Management, Production and Operations Management Society, vol. 32(3), pages 863-881, March.
    14. Lawrence Brown & Noah Gans & Avishai Mandelbaum & Anat Sakov & Haipeng Shen & Sergey Zeltyn & Linda Zhao & Novemer, "undated". "Statistical Analysis of a Telephone Call Center: A Queueing-Science Perspective," Center for Financial Institutions Working Papers 03-12, Wharton School Center for Financial Institutions, University of Pennsylvania.
    15. Athanasia Manou & Antonis Economou & Fikri Karaesmen, 2014. "Strategic Customers in a Transportation Station: When Is It Optimal to Wait?," Operations Research, INFORMS, vol. 62(4), pages 910-925, August.
    16. Achal Bassamboo & J. Michael Harrison & Assaf Zeevi, 2009. "Pointwise Stationary Fluid Models for Stochastic Processing Networks," Manufacturing & Service Operations Management, INFORMS, vol. 11(1), pages 70-89, August.
    17. Benjaafar, Saifallah, 1995. "Performance bounds for the effectiveness of pooling in multi-processing systems," European Journal of Operational Research, Elsevier, vol. 87(2), pages 375-388, December.
    18. Veeraruna Kavitha & Jayakrishnan Nair & Raman Kumar Sinha, 2019. "Pseudo conservation for partially fluid, partially lossy queueing systems," Annals of Operations Research, Springer, vol. 277(2), pages 255-292, June.
    19. Yong Tan & Kamran Moinzadeh & Vijay S. Mookerjee, 2005. "Optimal Processing Policies for an e-Commerce Web Server," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 99-110, February.
    20. Zeynep Akşin & Barış Ata & Seyed Morteza Emadi & Che-Lin Su, 2013. "Structural Estimation of Callers' Delay Sensitivity in Call Centers," Management Science, INFORMS, vol. 59(12), pages 2727-2746, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:metcap:v:5:y:2003:i:2:d:10.1023_a:1024501601020. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.