Skip to main content

A Retrial Tandem Queue with Two Types of Customers and Reservation of Channels

  • Conference paper
Modern Probabilistic Methods for Analysis of Telecommunication Networks (BWWQT 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 356))

Included in the following conference series:

Abstract

We consider a retrial tandem queue with two multi-server stations which can be considered as a mathematical model of a call center with two types of customers classified by their ability to wait for the connection to the agent. Customers arrive at Station 1 according the stationary Poisson flow. If an arriving customer meets all servers busy he/she goes to the infinite size orbit and retries after a random time. The type of a customer is randomly determined upon completion of the service at Station 1. If all servers of Station 2 are busy type 1 (priority) customer leaves the system forever while type 2 (non-priority) customer is queued in the buffer of limited size. If the buffer is full this customer leaves the system. The customers staying in the queue are impatient. This means that they might decide to leave the system before their service at Station 2 begins. It is assumed that a number of servers of Station 2 can be reserved to serve priority customers only. We calculate the stationary distribution and the main performance measures of the system. The cost function evaluating quality of service under different number of reserved server is constructed. Illustrative numerical example is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aksin, Z., Armony, M., Mehrotra, V.: The modern Call centers: a multidisciplinary perspective on operation management research. Production and Operation Management 16, 655–688 (2007)

    Google Scholar 

  2. Breuer, L., Dudin, A., Klimenok, V.: A retrial BMAP/PH/N system. Queueing Systems 40, 433–457 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Garnett, O., Mandelbaum, A., Reiman, M.: Designing a call center with impatient customers. Manufacturing and Service Operation Management 4, 208–227 (2002)

    Article  Google Scholar 

  4. Graham, A.: Kronecker Products and Matrix Calculus with Applications. Ellis Horwood, Cichester (1981)

    MATH  Google Scholar 

  5. Jouini, O., Dallery, Y., Aksin, Z.: Queueing models for full-flexible multi-class Call centers with real-time anticipated delays. Int. J. Production Economics 120, 389–399 (2009)

    Article  Google Scholar 

  6. Jouini, O., Pot, A., Dallery, Y.: Online scheduling policies for multicalass call canters with inpatient customers. European Journal of Operational Research 207, 258–268 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Khudyakov, P., Feigin, P., Mandelbaum, A.: Designing a call center with an IVR (Interactive Voice Response). Queueing Systems 66, 215–237 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. 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)

    Article  MathSciNet  MATH  Google Scholar 

  9. Neuts, M.: Matrix-Geometric Solutions in Stochastic Models - An Algorithmic Approach. Johns Hopkins University Press (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klimenok, V., Savko, R. (2013). A Retrial Tandem Queue with Two Types of Customers and Reservation of Channels. In: Dudin, A., Klimenok, V., Tsarenkov, G., Dudin, S. (eds) Modern Probabilistic Methods for Analysis of Telecommunication Networks. BWWQT 2013. Communications in Computer and Information Science, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35980-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35980-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35979-8

  • Online ISBN: 978-3-642-35980-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics