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

A Queueing Reward System with Several Customer Classes

Author

Listed:
  • Bruce L. Miller

    (The RAND Corporation, Santa Monica, California)

Abstract

This paper considers an n-server queueing system with m customer classes distinguished by the reward associated with serving customers of that class. Our objective is to accept or reject customers so as to maximize the expected value of the rewards received over an infinite planning horizon. By making the assumptions of Poisson arrivals and a common exponential service time this problem can be formulated as an infinite horizon continuous time Markov decision problem. In §3 we customize the general algorithm for solving continuous time Markov decision problems to our queueing model. In §4 we obtain qualitative results about the form of the optimal policy. §6 reports the results of simulation tests which compare heuristic policies for our model when the service times associated with each customer class have arbitrary distributions. The "winning" policy is based on a rather intricate theorem whose proof comprises §5.

Suggested Citation

  • Bruce L. Miller, 1969. "A Queueing Reward System with Several Customer Classes," Management Science, INFORMS, vol. 16(3), pages 234-245, November.
    • Handle: RePEc:inm:ormnsc:v:16:y:1969:i:3:p:234-245
    DOI: 10.1287/mnsc.16.3.234
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.16.3.234
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.16.3.234?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:16:y:1969:i:3:p:234-245. 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.