IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v21y1975i9p1049-1054.html
   My bibliography  Save this article

Relevant Policies for Markovian Queueing Systems with Many Types of Service

Author

Listed:
  • Avraham Beja

    (The Leon Recanati Graduate School of Business Administration, Tel-Aviv University)

  • Ariela Teller

    (The Leon Recanati Graduate School of Business Administration, Tel-Aviv University)

Abstract

A single station service system with bounded queue capacity operates in discrete time, and at each period, one out of K possible service rates is used. A subclass of the stationary nonrandomized policies--termed relevant--which uses only a subset of the available service rates, is proved optimal for the average cost criterion. If there is some type of service whereby the expected cost per served customer is no more than the expense of losing him, the service rate in all relevant policies increases with the number of customers observed in the system; if there is no such type of service, the service rate in all relevant policies decreases with the number of observed customers.

Suggested Citation

  • Avraham Beja & Ariela Teller, 1975. "Relevant Policies for Markovian Queueing Systems with Many Types of Service," Management Science, INFORMS, vol. 21(9), pages 1049-1054, May.
    • Handle: RePEc:inm:ormnsc:v:21:y:1975:i:9:p:1049-1054
    DOI: 10.1287/mnsc.21.9.1049
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.21.9.1049
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.21.9.1049?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:ormnsc:v:21:y:1975:i:9:p:1049-1054. 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.