IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v100y2022i3d10.1007_s11134-022-09788-1.html
   My bibliography  Save this article

Modelling heterogeneity in many-server queueing systems

Author

Listed:
  • Burak Büke

    (The University of Edinburgh)

Abstract

No abstract is available for this item.

Suggested Citation

  • Burak Büke, 2022. "Modelling heterogeneity in many-server queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 401-403, April.
    • Handle: RePEc:spr:queues:v:100:y:2022:i:3:d:10.1007_s11134-022-09788-1
    DOI: 10.1007/s11134-022-09788-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-022-09788-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-022-09788-1?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. Itay Gurvich & Ward Whitt, 2009. "Queue-and-Idleness-Ratio Controls in Many-Server Service Systems," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 363-396, May.
    2. Rami Atar & Adam Shwartz, 2008. "Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 899-909, November.
    3. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Rami Atar & Subhamay Saha, 2017. "An ɛ -Nash Equilibrium with High Probability for Strategic Customers in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 626-647, August.
    3. 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.
    4. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    5. Avishai Mandelbaum & Petar Momčilović & Yulia Tseytlin, 2012. "On Fair Routing from Emergency Departments to Hospital Wards: QED Queues with Heterogeneous Servers," Management Science, INFORMS, vol. 58(7), pages 1273-1291, July.
    6. Mor Armony & Amy R. Ward, 2010. "Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems," Operations Research, INFORMS, vol. 58(3), pages 624-637, June.
    7. Petar Momčilović & Amir Motaei, 2018. "QED limits for many-server systems under a priority policy," Queueing Systems: Theory and Applications, Springer, vol. 90(1), pages 125-159, October.
    8. Jeunghyun Kim & Ramandeep S. Randhawa & Amy R. Ward, 2018. "Dynamic Scheduling in a Many-Server, Multiclass System: The Role of Customer Impatience in Large Systems," Manufacturing & Service Operations Management, INFORMS, vol. 20(2), pages 285-301, May.
    9. Zhong, Zhiheng & Cao, Ping, 2023. "Balanced routing with partial information in a distributed parallel many-server queueing system," European Journal of Operational Research, Elsevier, vol. 304(2), pages 618-633.
    10. Rami Atar, 2012. "A Diffusion Regime with Nondegenerate Slowdown," Operations Research, INFORMS, vol. 60(2), pages 490-500, April.
    11. Zhenghua Long & Jiheng Zhang, 2019. "Virtual allocation policies for many-server queues with abandonment," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 90(3), pages 399-451, December.
    12. Jinsheng Chen & Jing Dong & Pengyi Shi, 2020. "A survey on skill-based routing with applications to service operations management," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 53-82, October.
    13. Cao, Ping & Zhong, Zhiheng & Huang, Junfei, 2021. "Dynamic routing in a distributed parallel many-server service system: The effect of ξ-choice," European Journal of Operational Research, Elsevier, vol. 294(1), pages 219-235.
    14. Rami Atar & Adam Shwartz, 2008. "Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 899-909, November.
    15. Avishai Mandelbaum & Petar Momčilović, 2017. "Personalized queues: the customer view, via a fluid model of serving least-patient first," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 23-53, October.
    16. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    17. 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.
    18. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    19. 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.
    20. 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.

    More about this item

    Statistics

    Access and download statistics

    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:queues:v:100:y:2022:i:3:d:10.1007_s11134-022-09788-1. 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.