Periodic routing to parallel queues and billiard sequences

Arie Hordijk () and Dinard van der Laan ()

Mathematical Methods of Operations Research, 2004, vol. 59, issue 2, 173-192

Abstract: In this companion paper of [10] we introduce the combinatorial notion of unbalance for a routing pattern. Using this unbalance we derive an upper bound for the total average expected waiting time of jobs which are routed to parallel queues according to a periodic routing rule. A billiard sequence is obtained with unbalance smaller than or equal to [InlineMediaObject not available: see fulltext.]−1, where N is the number of different symbols in the sequence which corresponds to the number of parallel queues in the routing problem. Copyright Springer-Verlag 2004

Keywords: Periodic routing; Parallel queues; Total unbalance; Upper bound; Billiard sequences (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860300322 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:59:y:2004:i:2:p:173-192

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860300322

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().