IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v71y2023i4p1387-1413.html
   My bibliography  Save this article

Managing Queues with Different Resource Requirements

Author

Listed:
  • Noa Zychlinski

    (Faculty of Industrial Engineering and Management, Technion Israel Institute of Technology, 32000 Haifa, Israel)

  • Carri W. Chan

    (Division of Decision, Risk, and Operations, Columbia Business School, New York, New York 10027)

  • Jing Dong

    (Division of Decision, Risk, and Operations, Columbia Business School, New York, New York 10027)

Abstract

Queueing models that are used to capture various service settings typically assume that customers require a single unit of resource (server) to be processed. However, there are many service settings where such an assumption may fail to capture the heterogeneity in resource requirements of different customers. We propose a multiserver queueing model with multiple customer classes in which customers from different classes may require different amounts of resources to be served. We study the optimal scheduling policy for such systems. To balance holding costs, service rates, resource requirement, and priority-induced idleness, we develop an index-based policy that we refer to as the idle-avoid c μ / m rule. For a two-class two-server model, where policy-induced idleness can have a big impact on system performance, we characterize cases where the idle-avoid c μ / m rule is optimal. In other cases, we establish a uniform performance bound on the amount of suboptimality incurred by the idle-avoid c μ / m rule. For general multiclass multiserver queues, we establish the asymptotic optimality of the idle-avoid c μ / m rule in the many-server regime. For long-time horizons, we show that the idle-avoid c μ / m is throughput optimal. Our theoretical results, along with numerical experiments, provide support for the good and robust performance of the proposed policy.

Suggested Citation

  • Noa Zychlinski & Carri W. Chan & Jing Dong, 2023. "Managing Queues with Different Resource Requirements," Operations Research, INFORMS, vol. 71(4), pages 1387-1413, July.
  • Handle: RePEc:inm:oropre:v:71:y:2023:i:4:p:1387-1413
    DOI: 10.1287/opre.2022.2284
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.2284
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2022.2284?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:oropre:v:71:y:2023:i:4:p:1387-1413. 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.