@inproceedings{cf16803b061249dfa8e0cc0ebd80acfc,
title = "Bounds for deterministic periodic routing sequences",
abstract = "We consider the problem of routing arriving jobs to parallel queues according to a deterministic periodic routing sequence. We introduce a combinatorial notion called the unbalance for such routing sequences. This unbalance is used to obtain an upper bound for the average waiting time of the routed jobs. The best upper bound for given (optimized) routing fractions is obtained when the unbalance is minimized. The problem of minimizing the unbalance is investigated and we show how to construct sequences with small unbalance.",
author = "A. Hordijk and {van der Laan}, {D. A.}",
year = "2001",
month = jan,
day = "1",
doi = "10.1007/3-540-45535-3_19",
language = "English",
isbn = "3540422250",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "236--250",
editor = "Karen Aardal and Bert Gerards",
booktitle = "Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings",
address = "Germany",
note = "8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001 ; Conference date: 13-06-2001 Through 15-06-2001",
}
