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

The unbalance and bounds on the average waiting time for periodic routing to one queue

Author

Listed:
  • Arie Hordijk
  • Dinard van der Laan

Abstract

In this paper we introduce the combinatorial notion of unbalance for a periodic zero-one splitting sequence. Using this unbalance we derive an upper bound for the average expected waiting time of jobs which are routed to one queue according to a periodic zero-one splitting sequence. In the companion paper [16] the upper bound will be extended to the routing to N parallel queues. Copyright Springer-Verlag 2004

Suggested Citation

  • Arie Hordijk & Dinard van der Laan, 2004. "The unbalance and bounds on the average waiting time for periodic routing to one queue," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(1), pages 1-23, February.
    • Handle: RePEc:spr:mathme:v:59:y:2004:i:1:p:1-23
    DOI: 10.1007/s001860300319
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bruno Gaujal & Arie Hordijk & Dinard van der Laan, 2005. "On the Optimal Policy for Deterministic and Exponential Polling Systems," Tinbergen Institute Discussion Papers 05-066/4, Tinbergen Institute.
    2. Jonatha Anselmi, 2017. "Asymptotically optimal open-loop load balancing," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 245-267, December.

    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:59:y:2004:i:1:p:1-23. 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.