Advertisement

Queueing System MAP/M/N as a Model of Call Center with Call-Back Option

  • Chesoong Kim
  • Olga Dudina
  • Alexander Dudin
  • Sergey Dudin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7314)

Abstract

A multi-server queueing system with a Markovian Arrival Process (MAP), an infinite buffer and impatient customers useful in modeling a call center with a call-back option is investigated. The service time of a customer by a server has an exponential distribution. If all servers are busy at a customer arrival epoch, the customer may leave the system forever or move to the buffer (such a customer is referred to as a real customer), or, alternatively, request for call-back (such a customer is referred to as a virtual customer). During a waiting period, the real customer can be impatient and can leave the system without the service or request for call-back (becomes a virtual customer). An efficient algorithm for calculating the stationary probabilities of system states is proposed. Some key performance measures are calculated. The Laplace-Stieltjes transform of the sojourn time distribution for virtual customers is derived. Some numerical results are presented.

Keywords

Call Center Call-Back Markovian Arrival Process Multi-Server Queueing System 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aksin, O.Z., Armony, M., Mehrotra, V.: The Modern Call Centers: a Multi-disciplinary Perspective on Operations Management Research. Working paper, Koc University, Istanbul, Turkey (2007)Google Scholar
  2. 2.
    Kim, J.W., Park, S.C.: Outsourcing strategy in two-stage call centers. Computers & Operations Research 37, 790–805 (2010)zbMATHCrossRefGoogle Scholar
  3. 3.
    Dudin, S., Dudina, O.: Call center operation model as a MAP/PH/N/R − N system with impatient customers. Problems of Information Transmission 47, 364–377 (2011)CrossRefGoogle Scholar
  4. 4.
    Armony, M., Maglaras, C.: On Customer Contact Centers with a Call-back Option: Customer Decisions, Routing Rules, and System Design. Operations Research 52(2), 271–292 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Armony, M., Maglaras, C.: Contact Centers with a Call-back Option and Real-Time Delay Information. Operations Research 52(4), 527–545 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Iravani, F., Balcioglu, B.: On Priority Queues with Impatient Customers. Queueing Systems 58, 239–260 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Lucantoni, D.: New Results on the Single Server Queue with a Batch Markovian Arrival Process. Communication in Statistics-Stochastic Models 7, 1–46 (1991)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Graham, A.: Kronecker Products and Matrix Calculus with Applications. Ellis Horwood, Chichester (1981)zbMATHGoogle Scholar
  9. 9.
    Neuts, M.: Matrix-geometric Solutions in Stochastic Models – An Algorithmic Approach. Johns Hopkins University Press, USA (1981)zbMATHGoogle Scholar
  10. 10.
    Klimenok, V.I., Dudin, A.N.: Multi-dimensional Asymptotically Quasi-Toeplitz Markov Chains and their Application in Queueing Theory. Queueing Systems 54, 245–259 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Kesten, H., Runnenburg, J.T.: Priority in Waiting Line Problems. Mathematisch Centrum, Amsterdam (1956)Google Scholar
  12. 12.
    van Danzig, D.: Chaines de Markof dans les ensembles abstraits et applications aux processus avec regions absorbantes et au probleme des boucles. Ann. de l’Inst. H. Poincare 14, 145–199 (1955)Google Scholar
  13. 13.
    Abate, J., Whitt, W.: Numerical Inversion of the Laplace Transforms of Probability Distributons. ORSA Journal on Computing 7(1), 36–43 (1955)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Chesoong Kim
    • 1
  • Olga Dudina
    • 2
  • Alexander Dudin
    • 2
  • Sergey Dudin
    • 2
  1. 1.Sangji UniversityWonjuKorea
  2. 2.Belarusian State UniversityMinskBelarus

Personalised recommendations