IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p1192-1228.html
   My bibliography  Save this article

Fluid Limits for Multiclass Many-Server Queues with General Reneging Distributions and Head-of-the-Line Scheduling

Author

Listed:
  • Amber L. Puha

    (Department of Mathematics, California State University San Marcos, San Marcos, California 92096)

  • Amy R. Ward

    (The University of Chicago Booth School of Business, Chicago, Illinois 60637)

Abstract

We describe a fluid model with time-varying input that approximates a multiclass many-server queue with general reneging distribution and multiple customer classes (specifically, the multiclass G/GI/N+GI queue). The system dynamics depend on the policy, which is a rule for determining when to serve a given customer class. The class of admissible control policies are those that are head-of-the-line (HL) and nonanticipating. For a sequence of many-server queues operating under admissible HL control policies and satisfying some mild asymptotic conditions, we establish a tightness result for the sequence of fluid scaled queue state descriptors and associated processes and show that limit points of such sequences are fluid model solutions almost surely. The tightness result together with the characterization of distributional limit points as fluid model solutions almost surely provides a foundation for the analysis of particular HL control policies of interest. We leverage these results to analyze a set of admissible HL control policies that we introduce, called weighted random buffer selection (WRBS), and an associated WRBS fluid model that allows multiple classes to be partially served in the fluid limit (which is in contrast to previously analyzed static priority policies).

Suggested Citation

  • Amber L. Puha & Amy R. Ward, 2022. "Fluid Limits for Multiclass Many-Server Queues with General Reneging Distributions and Head-of-the-Line Scheduling," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1192-1228, May.
  • Handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:1192-1228
    DOI: 10.1287/moor.2021.1166
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1166
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2021.1166?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
    ---><---

    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:inm:ormoor:v:47:y:2022:i:2:p:1192-1228. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.