On the convenience of pooling three heterogeneous queues

Ana Copelia Alvarado-Zepeda, Jorge Limón-Robles, Timothy Matis, María Del Carmen Temblador-Pérez

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This work evaluates the convenience of pooling three single server queues in parallel, understanding by pooling the integration of a system with three independent single server queues, to one with a single queue and the same number of multifunctional servers. Each system under analysis has Poisson arrivals, different Exponential service times and different utilizations, the metric used to evaluate is the mean waiting time in queue. Conclusions are stated about the conditions under which pooling is beneficial. The results are of both practical and theoretical interest: practical for clarifying the interaction of service time and utilizations in the convenience of pooling, and theoretical for a further research in an analytical expression and more complex queues.

Original languageEnglish
Title of host publicationIIE Annual Conference and Expo 2014
PublisherInstitute of Industrial Engineers
Pages3862-3868
Number of pages7
ISBN (Electronic)9780983762430
StatePublished - 2014
EventIIE Annual Conference and Expo 2014 - Montreal, Canada
Duration: May 31 2014Jun 3 2014

Publication series

NameIIE Annual Conference and Expo 2014

Conference

ConferenceIIE Annual Conference and Expo 2014
CountryCanada
CityMontreal
Period05/31/1406/3/14

Keywords

  • Industrial engineering
  • Operations research
  • Queueing theory
  • Stochastic processes

Fingerprint Dive into the research topics of 'On the convenience of pooling three heterogeneous queues'. Together they form a unique fingerprint.

  • Cite this

    Alvarado-Zepeda, A. C., Limón-Robles, J., Matis, T., & Del Carmen Temblador-Pérez, M. (2014). On the convenience of pooling three heterogeneous queues. In IIE Annual Conference and Expo 2014 (pp. 3862-3868). (IIE Annual Conference and Expo 2014). Institute of Industrial Engineers.