IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v120y2010i11p2103-2141.html
   My bibliography  Save this article

Optimal buffer size and dynamic rate control for a queueing system with impatient customers in heavy traffic

Author

Listed:
  • Ghosh, Arka P.
  • Weerasinghe, Ananda P.

Abstract

We address a rate control problem associated with a single server Markovian queueing system with customer abandonment in heavy traffic. The controller can choose a buffer size for the queueing system and also can dynamically control the service rate (equivalently the arrival rate) depending on the current state of the system. An infinite horizon cost minimization problem is considered here. The cost function includes a penalty for each rejected customer, a control cost related to the adjustment of the service rate and a penalty for each abandoning customer. We obtain an explicit optimal strategy for the limiting diffusion control problem (the Brownian control problem or BCP) which consists of a threshold-type optimal rejection process and a feedback-type optimal drift control. This solution is then used to construct an asymptotically optimal control policy, i.e. an optimal buffer size and an optimal service rate for the queueing system in heavy traffic. The properties of generalized regulator maps and weak convergence techniques are employed to prove the asymptotic optimality of this policy. In addition, we identify the parameter regimes where the infinite buffer size is optimal.

Suggested Citation

  • Ghosh, Arka P. & Weerasinghe, Ananda P., 2010. "Optimal buffer size and dynamic rate control for a queueing system with impatient customers in heavy traffic," Stochastic Processes and their Applications, Elsevier, vol. 120(11), pages 2103-2141, November.
  • Handle: RePEc:eee:spapps:v:120:y:2010:i:11:p:2103-2141
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(10)00175-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Baric{s} Ata & Shiri Shneorson, 2006. "Dynamic Control of an M/M/1 Service System with Adjustable Arrival and Service Rates," Management Science, INFORMS, vol. 52(11), pages 1778-1791, November.
    2. J. E. Reed & Amy R. Ward, 2008. "Approximating the GI/GI/1+GI Queue with a Nonlinear Drift Diffusion: Hazard Rate Scaling in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 606-644, August.
    3. Barış Ata, 2006. "Dynamic Control of a Multiclass Queue with Thin Arrival Streams," Operations Research, INFORMS, vol. 54(5), pages 876-892, October.
    4. Jennifer M. George & J. Michael Harrison, 2001. "Dynamic Control of a Queue with Adjustable Service Rate," Operations Research, INFORMS, vol. 49(5), pages 720-731, October.
    5. J. Michael Harrison & Lawrence M. Wein, 1990. "Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network," Operations Research, INFORMS, vol. 38(6), pages 1052-1064, December.
    6. Sunil Kumar & Kumar Muthuraman, 2004. "A Numerical Method for Solving Singular Stochastic Control Problems," Operations Research, INFORMS, vol. 52(4), pages 563-582, August.
    7. Amy R. Ward & Sunil Kumar, 2008. "Asymptotically Optimal Admission Control of a Queue with Impatient Customers," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 167-202, February.
    8. Lawrence M. Wein, 1990. "Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs," Operations Research, INFORMS, vol. 38(6), pages 1065-1078, December.
    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. Bar-Ilan, Avner & Marion, Nancy, 2013. "Demand for cash with intra-period endogenous consumption," Journal of Economic Dynamics and Control, Elsevier, vol. 37(12), pages 2668-2678.
    2. Ying Shi & Zhaotong Lian, 2016. "Equilibrium Strategies and Optimal Control for a Double-Ended Queue," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-18, June.
    3. Barιş Ata & Deishin Lee & Erkut Sönmez, 2019. "Dynamic Volunteer Staffing in Multicrop Gleaning Operations," Operations Research, INFORMS, vol. 67(2), pages 295-314, March.
    4. Lee, Chihoon & Weerasinghe, Ananda, 2011. "Convergence of a queueing system in heavy traffic with general patience-time distributions," Stochastic Processes and their Applications, Elsevier, vol. 121(11), pages 2507-2552, November.

    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. Barιş Ata & Deishin Lee & Erkut Sönmez, 2019. "Dynamic Volunteer Staffing in Multicrop Gleaning Operations," Operations Research, INFORMS, vol. 67(2), pages 295-314, March.
    2. Lee, Chihoon & Weerasinghe, Ananda, 2011. "Convergence of a queueing system in heavy traffic with general patience-time distributions," Stochastic Processes and their Applications, Elsevier, vol. 121(11), pages 2507-2552, November.
    3. 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.
    4. Amy R. Ward & Sunil Kumar, 2008. "Asymptotically Optimal Admission Control of a Queue with Impatient Customers," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 167-202, February.
    5. Ananda Weerasinghe, 2014. "Diffusion Approximations for G / M / n + GI Queues with State-Dependent Service Rates," Mathematics of Operations Research, INFORMS, vol. 39(1), pages 207-228, February.
    6. Erica L. Plambeck, 2008. "Asymptotically Optimal Control for an Assemble-to-Order System with Capacitated Component Production and Fixed Transport Costs," Operations Research, INFORMS, vol. 56(5), pages 1158-1171, October.
    7. Barış Ata, 2006. "Dynamic Control of a Multiclass Queue with Thin Arrival Streams," Operations Research, INFORMS, vol. 54(5), pages 876-892, October.
    8. René Caldentey & Lawrence M. Wein, 2006. "Revenue Management of a Make-to-Stock Queue," Operations Research, INFORMS, vol. 54(5), pages 859-875, October.
    9. Bertsimas, Dimitris & Paschalidis, Ioannis Ch. & Tsitsiklis, John N., 1992. "Optimization of multiclass queuing networks : polyhedral and nonlinear characterizations of achievable performance," Working papers 3509-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    10. Santiago R. Balseiro & David B. Brown & Chen Chen, 2021. "Dynamic Pricing of Relocating Resources in Large Networks," Management Science, INFORMS, vol. 67(7), pages 4075-4094, July.
    11. Shone, Rob & Glazebrook, Kevin & Zografos, Konstantinos G., 2019. "Resource allocation in congested queueing systems with time-varying demand: An application to airport operations," European Journal of Operational Research, Elsevier, vol. 276(2), pages 566-581.
    12. Dimitrakopoulos, Y. & Burnetas, A.N., 2016. "Customer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control," European Journal of Operational Research, Elsevier, vol. 252(2), pages 477-486.
    13. Wendell G. Gilland, 2001. "Effective Sequencing Rules for Closed Manufacturing Networks," Operations Research, INFORMS, vol. 49(5), pages 759-770, October.
    14. Wallace J. Hopp & Seyed M. R. Iravani & Gigi Y. Yuen, 2007. "Operations Systems with Discretionary Task Completion," Management Science, INFORMS, vol. 53(1), pages 61-77, January.
    15. Benjamin Legros, 2022. "The principal-agent problem for service rate event-dependency," Post-Print hal-03605421, HAL.
    16. 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.
    17. Paul Glasserman & Yashan Wang, 1999. "Fill-Rate Bottlenecks in Production-Inventory Networks," Manufacturing & Service Operations Management, INFORMS, vol. 1(1), pages 62-76.
    18. Shuangchi He & Dacheng Yao & Hanqin Zhang, 2017. "Optimal Ordering Policy for Inventory Systems with Quantity-Dependent Setup Costs," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 979-1006, November.
    19. Dieter Armbruster & Daniel E. Marthaler & Christian Ringhofer & Karl Kempf & Tae-Chang Jo, 2006. "A Continuum Model for a Re-entrant Factory," Operations Research, INFORMS, vol. 54(5), pages 933-950, October.
    20. Junfei Huang & Boaz Carmeli & Avishai Mandelbaum, 2015. "Control of Patient Flow in Emergency Departments, or Multiclass Queues with Deadlines and Feedback," Operations Research, INFORMS, vol. 63(4), pages 892-908, 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:eee:spapps:v:120:y:2010:i:11:p:2103-2141. 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/wps/find/journaldescription.cws_home/505572/description#description .

    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.