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

Realizable Performance Vectors of a Finite-Source Queue

Author

Listed:
  • Hisao Kameda

    (The University of Electro-Communications, Chofu, Tokyo, Japan)

Abstract

We study a scheduling problem on a finite-source queueing model which is identical to a two-stage closed Markovian cyclic queue consisting of a single-server (“processor”) and an infinite-server (“terminals”); each job has a distinct mean service time at the processor. We obtain a necessary and sufficient condition for a performance vector consisting of utilization factors (or average response times) of the processor for the jobs to be achievable by some scheduling strategy. The result is analogous to that obtained by Coffman and Mitrani on infinite-source single-server queues.

Suggested Citation

  • Hisao Kameda, 1984. "Realizable Performance Vectors of a Finite-Source Queue," Operations Research, INFORMS, vol. 32(6), pages 1358-1367, December.
    • Handle: RePEc:inm:oropre:v:32:y:1984:i:6:p:1358-1367
    DOI: 10.1287/opre.32.6.1358
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.32.6.1358
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.32.6.1358?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:32:y:1984:i:6:p:1358-1367. 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.