IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/1997010.html
   My bibliography  Save this paper

Scheduling multiclass queueing networks on parallel servers : approximate and heavy-traffic optimality of Klimov’s rule

Author

Listed:
  • GLAZEBROOK, Kevin

    (Department of Statistics, Newcastle University, Newcastle upon Tyne, UK)

  • NINO-MORA, José

    (Center for Operations Research and Econometrics (CORE), Université catholique de Louvain (UCL), Louvain la Neuve, Belgium)

Abstract

We address the problem of scheduling a multiclass queueing network on M parallel servers to minimize the time-average holding cost. We analyze a heuristic index rule, based on Klimov’s solution to the single-server model: when a server becomes free it selects a customer with largest Klimov’s index. We present closed-form performance guarantees for this heuristic, with respect to (1) the optimal cost in the original parallel-servers network, and (2) the optimal cost in a “corresponding” single-server network, attended by a server working M times faster. Simpler expressions are derived for the special case that there is no customer feedback, where the heuristic becomes the c?-rule. Our analysis is based on comparing the cost of the heuristic to the value of (the dual of) a strong linear programming relaxation, which equals the optimal cost for the “corresponding” single-server network. This relaxation follows from a set of approximate conservation laws satisfied by the network. Our proof of these laws relies on the first set of work decomposition laws known for this model, which we obtain from a classical flow conservation law.

Suggested Citation

  • GLAZEBROOK, Kevin & NINO-MORA, José, 1997. "Scheduling multiclass queueing networks on parallel servers : approximate and heavy-traffic optimality of Klimov’s rule," LIDAM Discussion Papers CORE 1997010, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:1997010
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp1997.html
    Download Restriction: no
    ---><---

    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:cor:louvco:1997010. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.