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

Note--Optimal Assignment of Customers in a Two Server Congestion System with No Waiting Room

Author

Listed:
  • Wayne Winston

    (Indiana University)

Abstract

We consider a two server congestion system which is heterogeneous in the sense that the reward received depends on the match between server and customer. In particular, if a type s customer (s = 1, 2, 3, ...) is assigned to server i (i = 1, 2) a reward R st is earned. Service time is assumed to depend only on customer type. Upon arrival a customer must be assigned to a server, (if one is available) with all customers who find both servers occupied being turned away. The policy that maximizes the long-run expected reward earned over an infinite horizon is shown to depend on a single critical number. Applications to the deployment of fire engines and assignment of patients to coronary care units are briefly discussed.

Suggested Citation

  • Wayne Winston, 1978. "Note--Optimal Assignment of Customers in a Two Server Congestion System with No Waiting Room," Management Science, INFORMS, vol. 24(6), pages 702-705, February.
    • Handle: RePEc:inm:ormnsc:v:24:y:1978:i:6:p:702-705
    DOI: 10.1287/mnsc.24.6.702
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.24.6.702
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.24.6.702?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:24:y:1978:i:6:p:702-705. 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.