IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v273y2019i1p259-277.html
   My bibliography  Save this article

Design heuristic for parallel many server systems

Author

Listed:
  • Adan, Ivo J.B.F.
  • Boon, Marko A.A.
  • Weiss, Gideon

Abstract

We study a parallel queueing system with multiple types of servers and customers. A bipartite graph describes which pairs of customer-server types are compatible. We consider the service policy that always assigns servers to the first, longest waiting compatible customer, and that always assigns customers to the longest idle compatible server if on arrival multiple compatible servers are available. For a general renewal stream of arriving customers, general service time distributions that depend both on customer and on server types, and general customer patience distributions, the behavior of such systems is very complicated. Key quantities for their performance are the matching rates, the fraction of services for each pair of compatible customer-server. Calculation of these matching rates in general is intractable, it depends on the entire shape of service time distributions. We suggest through a heuristic argument that if the number of servers becomes large, the matching rates are well approximated by matching rates calculated from the tractable bipartite infinite matching model. We present simulation evidence to support this heuristic argument, and show how this can be used to design systems with desired performance requirements.

Suggested Citation

  • Adan, Ivo J.B.F. & Boon, Marko A.A. & Weiss, Gideon, 2019. "Design heuristic for parallel many server systems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 259-277.
    • Handle: RePEc:eee:ejores:v:273:y:2019:i:1:p:259-277
    DOI: 10.1016/j.ejor.2018.08.042
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718307379
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.08.042?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. 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.
    3. Ivo Adan & Ana Bušić & Jean Mairesse & Gideon Weiss, 2018. "Reversibility and Further Properties of FCFS Infinite Bipartite Matching," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 598-621, May.
    4. Dongyuan Zhan & Gideon Weiss, 2018. "Many-server scaling of the N-system under FCFS–ALIS," Queueing Systems: Theory and Applications, Springer, vol. 88(1), pages 27-71, February.
    5. Ward Whitt, 2006. "Fluid Models for Multiserver Queues with Abandonments," Operations Research, INFORMS, vol. 54(1), pages 37-54, February.
    6. Itai Gurvich & Ward Whitt, 2010. "Service-Level Differentiation in Many-Server Service Systems via Queue-Ratio Routing," Operations Research, INFORMS, vol. 58(2), pages 316-328, April.
    7. Linda Green, 1985. "A Queueing System with General-Use and Limited-Use Servers," Operations Research, INFORMS, vol. 33(1), pages 168-182, February.
    8. Melanie Rubino & Barış Ata, 2009. "Dynamic Control of a Make-to-Order, Parallel-Server System with Cancellations," Operations Research, INFORMS, vol. 57(1), pages 94-108, February.
    9. Samim Ghamami & Amy R. Ward, 2013. "Dynamic Scheduling of a Two-Server Parallel Server System with Complete Resource Pooling and Reneging in Heavy Traffic: Asymptotic Optimality of a Two-Threshold Policy," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 761-824, November.
    10. 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.
    11. 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.
    12. Rodney B. Wallace & Ward Whitt, 2005. "A Staffing Algorithm for Call Centers with Skill-Based Routing," Manufacturing & Service Operations Management, INFORMS, vol. 7(4), pages 276-294, August.
    13. J. Michael Harrison & Assaf Zeevi, 2005. "A Method for Staffing Large Call Centers Based on Stochastic Fluid Models," Manufacturing & Service Operations Management, INFORMS, vol. 7(1), pages 20-36, September.
    14. Tolga Tezcan & J. G. Dai, 2010. "Dynamic Control of N -Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic," Operations Research, INFORMS, vol. 58(1), pages 94-110, February.
    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. Akter, Shahriar & Dwivedi, Yogesh K. & Sajib, Shahriar & Biswas, Kumar & Bandara, Ruwan J. & Michael, Katina, 2022. "Algorithmic bias in machine learning-based marketing models," Journal of Business Research, Elsevier, vol. 144(C), pages 201-216.
    2. Dr. Kyriazopoulos Georgios & Thanou Efthymia, 2020. "Mergers and Acquisitions and how they affect the Labor productivity. Evidence from the Greek Banking system," Journal of Applied Finance & Banking, SCIENPRESS Ltd, vol. 10(2), pages 1-3.
    3. Gideon Weiss, 2022. "Parallel multi-type many server conjecture," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 269-271, April.
    4. 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.
    5. 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.
    6. Gideon Weiss, 2020. "Directed FCFS infinite bipartite matching," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 387-418, December.

    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. Dongyuan Zhan & Gideon Weiss, 2018. "Many-server scaling of the N-system under FCFS–ALIS," Queueing Systems: Theory and Applications, Springer, vol. 88(1), pages 27-71, February.
    2. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    3. 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.
    4. Wyean Chan & Ger Koole & Pierre L'Ecuyer, 2014. "Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 544-560, October.
    5. Merve Bodur & James R. Luedtke, 2017. "Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty," Management Science, INFORMS, vol. 63(7), pages 2073-2091, July.
    6. Carri W. Chan & Linda V. Green & Suparerk Lekwijit & Lijian Lu & Gabriel Escobar, 2019. "Assessing the Impact of Service Level When Customer Needs Are Uncertain: An Empirical Investigation of Hospital Step-Down Units," Management Science, INFORMS, vol. 65(2), pages 751-775, February.
    7. 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.
    8. Ari Arapostathis & Guodong Pang, 2018. "Infinite-Horizon Average Optimality of the N-Network in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 838-866, August.
    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. Arapostathis, Ari & Pang, Guodong, 2019. "Infinite horizon asymptotic average optimality for large-scale parallel server networks," Stochastic Processes and their Applications, Elsevier, vol. 129(1), pages 283-322.
    11. 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.
    12. 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.
    13. Achal Bassamboo & Ramandeep Singh Randhawa, 2016. "Scheduling Homogeneous Impatient Customers," Management Science, INFORMS, vol. 62(7), pages 2129-2147, July.
    14. 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.
    15. Ragavendran Gopalakrishnan & Sherwin Doroudi & Amy R. Ward & Adam Wierman, 2016. "Routing and Staffing When Servers Are Strategic," Operations Research, INFORMS, vol. 64(4), pages 1033-1050, August.
    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 & Assaf Zeevi, 2009. "On a Data-Driven Method for Staffing Large Call Centers," Operations Research, INFORMS, vol. 57(3), pages 714-726, June.
    18. 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.
    19. J. G. Dai & Pengyi Shi, 2019. "Inpatient Overflow: An Approximate Dynamic Programming Approach," Manufacturing & Service Operations Management, INFORMS, vol. 21(4), pages 894-911, October.
    20. Noah Gans & Yong-Pin Zhou, 2007. "Call-Routing Schemes for Call-Center Outsourcing," Manufacturing & Service Operations Management, INFORMS, vol. 9(1), pages 33-50, 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:eee:ejores:v:273:y:2019:i:1:p:259-277. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.