IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v47y1998i2p317-336.html
   My bibliography  Save this article

Analysis of a finite-source customer assignment model with no state information

Author

Listed:
  • Arie Hordijk
  • Anneke Loeve
  • Jeroen Tiggelman

Abstract

In this paper we analyse a closed queueing network in which customers have to be assigned to parallel queues. The routing decision may not depend on the numbers of customers in the queues. We present an algorithm and we show that it computes an average optimal policy in case of exponential service times. The algorithm also works for non-exponential service times, in which case periodic policies are found. Copyright Physica-Verlag 1998

Suggested Citation

  • Arie Hordijk & Anneke Loeve & Jeroen Tiggelman, 1998. "Analysis of a finite-source customer assignment model with no state information," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 47(2), pages 317-336, June.
    • Handle: RePEc:spr:mathme:v:47:y:1998:i:2:p:317-336
    DOI: 10.1007/BF01194403
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF01194403
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF01194403?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:mathme:v:47:y:1998:i:2:p:317-336. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.