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

Asymptotically optimal control of N-systems with $$H_2^*$$ H 2 ∗ service times under many-server heavy traffic

Author

Listed:
  • Arka Ghosh

    (Iowa State University)

  • Keguo Huang

    (Iowa State University)

Abstract

We address a control problem for a queueing system, known as the “N-system,” under the Halfin–Whitt heavy-traffic regime. It has two customer classes and two server pools: servers from one pool can serve both customer classes, while servers from the other pool can only serve one class. The service time is assumed to follow a special case of hyper-exponential distributions, called the $$H^*_2$$ H 2 ∗ distribution, and customers are impatient. We consider an expected infinite-horizon discounted cost function, with linear holding and abandonment cost components. A static priority policy is proposed and is shown to be asymptotically optimal in a certain parameter regime, using weak convergence techniques.

Suggested Citation

  • Arka Ghosh & Keguo Huang, 2017. "Asymptotically optimal control of N-systems with $$H_2^*$$ H 2 ∗ service times under many-server heavy traffic," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 35-60, June.
    • Handle: RePEc:spr:queues:v:86:y:2017:i:1:d:10.1007_s11134-017-9518-1
    DOI: 10.1007/s11134-017-9518-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-017-9518-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-017-9518-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. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    2. J. G. Dai & Tolga Tezcan, 2011. "State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 271-320, May.
    3. Lawrence Brown & Noah Gans & Avishai Mandelbaum & Anat Sakov & Haipeng Shen & Sergey Zeltyn & Linda Zhao, 2005. "Statistical Analysis of a Telephone Call Center: A Queueing-Science Perspective," Journal of the American Statistical Association, American Statistical Association, vol. 100, pages 36-50, March.
    4. 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.
    5. Ward Whitt, 2005. "Heavy-Traffic Limits for the G / H 2 */ n / m Queue," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 1-27, February.
    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. Dongyuan Zhan & Amy R. Ward, 2014. "Threshold Routing to Trade Off Waiting and Call Resolution in Call Centers," Manufacturing & Service Operations Management, INFORMS, vol. 16(2), pages 220-237, May.
    2. 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.
    3. 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.
    4. Jinsheng Chen & Jing Dong, 2024. "Managing flexibility: optimal sizing and scheduling of flexible servers," Queueing Systems: Theory and Applications, Springer, vol. 108(3), pages 415-474, December.
    5. Leon Cui & Tolga Tezcan, 2016. "Approximations for Chat Service Systems Using Many-Server Diffusion Limits," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 775-807, August.
    6. Reza Aghajani & Kavita Ramanan, 2020. "The Limit of Stationary Distributions of Many-Server Queues in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 1016-1055, August.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Zhang, Ping & Serban, Nicoleta, 2007. "Discovery, visualization and performance analysis of enterprise workflow," Computational Statistics & Data Analysis, Elsevier, vol. 51(5), pages 2670-2687, February.
    12. 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.
    13. Defraeye, Mieke & Van Nieuwenhuyse, Inneke, 2016. "Staffing and scheduling under nonstationary demand for service: A literature review," Omega, Elsevier, vol. 58(C), pages 4-25.
    14. 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.
    15. Atar, Rami & Biswas, Anup & Kaspi, Haya, 2018. "Law of large numbers for the many-server earliest-deadline-first queue," Stochastic Processes and their Applications, Elsevier, vol. 128(7), pages 2270-2296.
    16. Patrick Eschenfeldt & David Gamarnik, 2018. "Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 867-886, August.
    17. Jing Dong & Rouba Ibrahimb, 2020. "Managing Supply in the On-Demand Economy: Flexible Workers, Full-Time Employees, or Both?," Operations Research, INFORMS, vol. 68(4), pages 1238-1264, July.
    18. 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.
    19. Eugene Furman & Adam Diamant & Murat Kristal, 2021. "Customer Acquisition and Retention: A Fluid Approach for Staffing," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4236-4257, November.
    20. 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.

    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:86:y:2017:i:1:d:10.1007_s11134-017-9518-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.