IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v40y1992i3-supplement-2ps293-s299.html
   My bibliography  Save this article

Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control

Author

Listed:
  • J. George Shanthikumar

    (University of California, Berkeley, California)

  • David D. Yao

    (Columbia University, New York, New York)

Abstract

In many multiclass queueing systems, certain performance measures of interest satisfy strong conservation laws . That is, the total performance over all job types is invariant under any nonidling service control rule, and the total performance over any subset (say A ) of job types is minimized or maximized by offering absolute priority to the types in A over all other types. We develop a formal definition of strong conservation laws, and show that as a necessary consequence of these strong conservation laws, the state space of the performance vector is a (base of a) polymatroid. From known results in polymatroidal theory, the vertices of this polyhedron are easily identified, and these vertices correspond to absolute priority rules. A wide variety of multiclass queueing systems are shown to have this polymatroidal structure, which greatly facilitates the study of the optimal scheduling control of such systems. When the defining set function of the performance space belongs to the class of generalized symmetric functions, additional applications are discussed, which include establishing convexity and concavity properties in various queueing systems.

Suggested Citation

  • J. George Shanthikumar & David D. Yao, 1992. "Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control," Operations Research, INFORMS, vol. 40(3-supplem), pages 293-299, June.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:3-supplement-2:p:s293-s299
    DOI: 10.1287/opre.40.3.S293
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.3.S293
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.3.S293?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:40:y:1992:i:3-supplement-2:p:s293-s299. 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.