IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v54y2008i8p1513-1527.html
   My bibliography  Save this article

Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing

Author

Listed:
  • Rishi Talreja

    (Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027)

  • Ward Whitt

    (Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027)

Abstract

Motivated by models of tenant assignment in public housing, we study approximating deterministic fluid models for overloaded queueing systems having multiple customer classes (classes of tenants) and multiple service pools (housing authorities), each with many servers (housing units). Customer abandonment acts to keep the system stable, yielding a proper steady-state description. Motivated by fairness considerations, we assume that customers are selected for service by newly available servers on a first-come, first-served (FCFS) basis from all classes the corresponding service pools are allowed to serve. In this context, it is challenging to determine stationary routing flow rates between customer classes and service pools. Given those routing flow rates, each single fluid queue can be analyzed separately using previously established methods. Our ability to determine the routing flow rates depends on the structure of the network routing graph. We obtain the desired routing flow rates in three cases: when the routing graph is (i) a tree (sparsely connected), (ii) complete bipartite (fully connected), and (iii) an appropriate combination of the previous two cases. Other cases remain unsolved. In the last two solved cases, the routing flow rates are actually not uniquely determined by the fluid model, but become so once we make stochastic assumptions about the queueing models that the fluid model approximates.

Suggested Citation

  • Rishi Talreja & Ward Whitt, 2008. "Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing," Management Science, INFORMS, vol. 54(8), pages 1513-1527, August.
    • Handle: RePEc:inm:ormnsc:v:54:y:2008:i:8:p:1513-1527
    DOI: 10.1287/mnsc.1080.0868
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.1080.0868
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.1080.0868?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
    ---><---

    References listed on IDEAS

    as
    1. Johnson, Michael P., 2001. "Tenant-based subsidized housing location planning under uncertainty," Socio-Economic Planning Sciences, Elsevier, vol. 35(3), pages 149-173, September.
    2. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    3. Ward Whitt, 2004. "Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments," Management Science, INFORMS, vol. 50(10), pages 1449-1461, October.
    4. Noah Gans & Ger Koole & Avishai Mandelbaum, 2003. "Telephone Call Centers: Tutorial, Review, and Research Prospects," Manufacturing & Service Operations Management, INFORMS, vol. 5(2), pages 79-141, September.
    5. Michael Johnson, 2003. "Single-Period Location Models for Subsidized Housing: Tenant-Based Subsidies," Annals of Operations Research, Springer, vol. 123(1), pages 105-124, October.
    6. Edward H. Kaplan, 1986. "Tenant Assignment Models," Operations Research, INFORMS, vol. 34(6), pages 832-843, December.
    7. Ward Whitt, 1984. "Departures from a Queue with Many Busy Servers," Mathematics of Operations Research, INFORMS, vol. 9(4), pages 534-544, November.
    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. Otis B. Jennings & Josh E. Reed, 2012. "An Overloaded Multiclass FIFO Queue with Abandonments," Operations Research, INFORMS, vol. 60(5), pages 1282-1295, October.
    2. Chen Li & Junjun Zheng & Hiroyuki Okamura & Tadashi Dohi, 2023. "Performance Evaluation of a Cloud Datacenter Using CPU Utilization Data," Mathematics, MDPI, vol. 11(3), pages 1-16, January.
    3. John N. Tsitsiklis & Kuang Xu, 2017. "Flexible Queueing Architectures," Operations Research, INFORMS, vol. 65(5), pages 1398-1413, October.
    4. Barış Ata & Anton Skaro & Sridhar Tayur, 2017. "OrganJet: Overcoming Geographical Disparities in Access to Deceased Donor Kidneys in the United States," Management Science, INFORMS, vol. 63(9), pages 2776-2794, September.
    5. Yongjiang Guo & Xiyang Hou & Yunan Liu, 2021. "A functional law of the iterated logarithm for multi-class queues with batch arrivals," Annals of Operations Research, Springer, vol. 300(1), pages 51-77, May.
    6. Francisco Castro & Hamid Nazerzadeh & Chiwei Yan, 2020. "Matching queues with reneging: a product form solution," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 359-385, December.
    7. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    8. Ivo Adan & Brett Hathaway & Vidyadhar G. Kulkarni, 2019. "On first-come, first-served queues with two classes of impatient customers," Queueing Systems: Theory and Applications, Springer, vol. 91(1), pages 113-142, February.

    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. Opher Baron & Joseph Milner, 2009. "Staffing to Maximize Profit for Call Centers with Alternate Service-Level Agreements," Operations Research, INFORMS, vol. 57(3), pages 685-700, June.
    2. Avishai Mandelbaum & Petar Momčilović, 2008. "Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 561-586, August.
    3. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    4. Guodong Pang & Ward Whitt, 2009. "Service Interruptions in Large-Scale Service Systems," Management Science, INFORMS, vol. 55(9), pages 1499-1512, September.
    5. Jouini, Oualid & Pot, Auke & Koole, Ger & Dallery, Yves, 2010. "Online scheduling policies for multiclass call centers with impatient customers," European Journal of Operational Research, Elsevier, vol. 207(1), pages 258-268, November.
    6. Itai Gurvich & Ohad Perry, 2012. "Overflow Networks: Approximations and Implications to Call Center Outsourcing," Operations Research, INFORMS, vol. 60(4), pages 996-1009, August.
    7. Francis de Véricourt & Otis B. Jennings, 2008. "Dimensioning Large-Scale Membership Services," Operations Research, INFORMS, vol. 56(1), pages 173-187, February.
    8. Guodong Pang & Ohad Perry, 2015. "A Logarithmic Safety Staffing Rule for Contact Centers with Call Blending," Management Science, INFORMS, vol. 61(1), pages 73-91, January.
    9. Mor Armony & Avishai Mandelbaum, 2011. "Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers," Operations Research, INFORMS, vol. 59(1), pages 50-65, February.
    10. Ward Whitt, 2004. "A Diffusion Approximation for the G/GI/n/m Queue," Operations Research, INFORMS, vol. 52(6), pages 922-941, December.
    11. Ward Whitt, 2006. "Sensitivity of Performance in the Erlang-A Queueing Model to Changes in the Model Parameters," Operations Research, INFORMS, vol. 54(2), pages 247-260, April.
    12. Avishai Mandelbaum & Petar Momčilović, 2012. "Queues with Many Servers and Impatient Customers," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 41-65, February.
    13. Achal Bassamboo & J. Michael Harrison & Assaf Zeevi, 2006. "Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method," Operations Research, INFORMS, vol. 54(3), pages 419-435, June.
    14. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    15. Achal Bassamboo & Assaf Zeevi, 2009. "On a Data-Driven Method for Staffing Large Call Centers," Operations Research, INFORMS, vol. 57(3), pages 714-726, June.
    16. van Leeuwaarden, Johan S.H. & Knessl, Charles, 2011. "Transient behavior of the Halfin-Whitt diffusion," Stochastic Processes and their Applications, Elsevier, vol. 121(7), pages 1524-1545, July.
    17. A. J. E. M. Janssen & J. S. H. van Leeuwaarden & Bert Zwart, 2011. "Refining Square-Root Safety Staffing by Expanding Erlang C," Operations Research, INFORMS, vol. 59(6), pages 1512-1522, December.
    18. Alexander L. Stolyar & Tolga Tezcan, 2011. "Shadow-Routing Based Control of Flexible Multiserver Pools in Overload," Operations Research, INFORMS, vol. 59(6), pages 1427-1444, December.
    19. Zhenghua Long & Nahum Shimkin & Hailun Zhang & Jiheng Zhang, 2020. "Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ / h Rule," Operations Research, INFORMS, vol. 68(4), pages 1128-1230, July.
    20. Max Tschaikowski & Mirco Tribastone, 2017. "A computational approach to steady-state convergence of fluid limits for Coxian queuing networks with abandonment," Annals of Operations Research, Springer, vol. 252(1), pages 101-120, May.

    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:inm:ormnsc:v:54:y:2008:i:8:p:1513-1527. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.