IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v82y2016i3d10.1007_s11134-015-9468-4.html
   My bibliography  Save this article

Maximum weight matching with hysteresis in overloaded queues with setups

Author

Listed:
  • Carri W. Chan

    (Columbia Business School)

  • Mor Armony

    (New York University)

  • Nicholas Bambos

    (Stanford University)

Abstract

We consider a system of parallel queues where arriving service tasks are buffered, according to type. Available service resources are dynamically configured and allocated to the queues to process the tasks. At each point in time, a scheduler chooses a service configuration across the queues, in response to queue backlogs. Switching from one service configuration to another incurs a setup time, during which idling occurs and service bandwidth is lost. Such setup times are inherent in manufacturing and computer systems. Frequent switchings can significantly compromise the service capacity of such systems. A maximum weight matching (MWM) scheduler, which is known to maximize throughput in the absence of setups, can easily become unstable with setups, even under low load. To remedy this problem, we propose a new MWM-H scheduler which utilizes a controller introduced hysteresis and achieves maximum throughput even with setups, without requiring knowledge of arrival rates and average traffic loads. During prolonged traffic bursts, the queues may become overloaded and the issue becomes how to reasonably distribute the growing backlog under MWM-H. It is shown that by appropriately selecting the MWM-H parameters, one can control the backlog among the individual queues in order to achieve a desired balance.

Suggested Citation

  • Carri W. Chan & Mor Armony & Nicholas Bambos, 2016. "Maximum weight matching with hysteresis in overloaded queues with setups," Queueing Systems: Theory and Applications, Springer, vol. 82(3), pages 315-351, April.
  • Handle: RePEc:spr:queues:v:82:y:2016:i:3:d:10.1007_s11134-015-9468-4
    DOI: 10.1007/s11134-015-9468-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-015-9468-4
    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-015-9468-4?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. J. G. Dai & O. B. Jennings, 2004. "Stabilizing Queueing Networks with Setups," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 891-922, November.
    2. Avishai Mandelbaum & Alexander L. Stolyar, 2004. "Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule," Operations Research, INFORMS, vol. 52(6), pages 836-855, December.
    3. Dimitris Bertsimas & José Niño-Mora, 1999. "Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part II, The Multi-Station Case," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 331-361, May.
    4. Wei-Min Lan & Tava Lennon Olsen, 2006. "Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules," Operations Research, INFORMS, vol. 54(3), pages 505-522, June.
    5. Ohad Perry & Ward Whitt, 2009. "Responding to Unexpected Overloads in Large-Scale Service Systems," Management Science, INFORMS, vol. 55(8), pages 1353-1367, August.
    6. Ohad Perry & Ward Whitt, 2011. "A Fluid Approximation for Service Systems Responding to Unexpected Overloads," Operations Research, INFORMS, vol. 59(5), pages 1159-1170, October.
    7. Dimitris Bertsimas & José Niño-Mora, 1999. "Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 306-330, May.
    8. F. V. Lu & R. F. Serfozo, 1984. "M / M /1 Queueing Decision Processes with Monotone Hysteretic Optimal Policies," Operations Research, INFORMS, vol. 32(5), pages 1116-1132, October.
    9. Itay Gurvich & Ward Whitt, 2009. "Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 237-253, June.
    10. 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.
    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. Jewgeni H. Dshalalow & Ahmed Merie & Ryan T. White, 2020. "Fluctuation Analysis in Parallel Queues with Hysteretic Control," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 295-327, March.
    2. Chang-Heng Wang & Siva Theja Maguluri & Tara Javidi, 2021. "Heavy traffic queue length scaling in switches with reconfiguration delay," Queueing Systems: Theory and Applications, Springer, vol. 98(1), pages 49-93, June.

    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. 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.
    2. 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.
    3. Otis B. Jennings, 2008. "Heavy-Traffic Limits of Queueing Networks with Polling Stations: Brownian Motion in a Wedge," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 12-35, February.
    4. Ohad Perry & Ward Whitt, 2013. "A Fluid Limit for an Overloaded X Model via a Stochastic Averaging Principle," Mathematics of Operations Research, INFORMS, vol. 38(2), pages 294-349, May.
    5. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    6. 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.
    7. 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.
    8. Silviya Valeva & Guodong Pang & Andrew J. Schaefer & Gilles Clermont, 2023. "Acuity-Based Allocation of ICU-Downstream Beds with Flexible Staffing," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 403-422, March.
    9. Tom F. Tan & Bradley R. Staats, 2020. "Behavioral Drivers of Routing Decisions: Evidence from Restaurant Table Assignment," Production and Operations Management, Production and Operations Management Society, vol. 29(4), pages 1050-1070, April.
    10. Wei-Min Lan & Tava Lennon Olsen, 2006. "Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules," Operations Research, INFORMS, vol. 54(3), pages 505-522, 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. Kuang Xu & Yuan Zhong, 2020. "Information and Memory in Dynamic Resource Allocation," Operations Research, INFORMS, vol. 68(6), pages 1698-1715, November.
    13. Daniel Adelman, 2007. "Price-Directed Control of a Closed Logistics Queueing Network," Operations Research, INFORMS, vol. 55(6), pages 1022-1038, December.
    14. Gregory Dobson & Tolga Tezcan & Vera Tilson, 2013. "Optimal Workflow Decisions for Investigators in Systems with Interruptions," Management Science, INFORMS, vol. 59(5), pages 1125-1141, May.
    15. 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.
    16. David Gamarnik, 2007. "On the Undecidability of Computing Stationary Distributions and Large Deviation Rates for Constrained Random Walks," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 257-265, May.
    17. Dimitris Bertsimas & David Gamarnik & Alexander Anatoliy Rikun, 2011. "Performance Analysis of Queueing Networks via Robust Optimization," Operations Research, INFORMS, vol. 59(2), pages 455-466, April.
    18. Vijay Mehrotra & Kevin Ross & Geoff Ryder & Yong-Pin Zhou, 2012. "Routing to Manage Resolution and Waiting Time in Call Centers with Heterogeneous Servers," Manufacturing & Service Operations Management, INFORMS, vol. 14(1), pages 66-81, January.
    19. 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.
    20. Li Xia & Zhe George Zhang & Quan‐Lin Li, 2022. "A c/μ‐Rule for Job Assignment in Heterogeneous Group‐Server Queues," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1191-1215, March.

    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:82:y:2016:i:3:d:10.1007_s11134-015-9468-4. 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.