Bounds for deterministic periodic routing sequences

A. Hordijk; D. A. van der Laan

doi:10.1007/3-540-45535-3_19

Bounds for deterministic periodic routing sequences

A. Hordijk
, D. A. van der Laan

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

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.

Original language	English
Title of host publication	Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings
Editors	Karen Aardal, Bert Gerards
Publisher	Springer Verlag
Pages	236-250
Number of pages	15
ISBN (Print)	3540422250, 9783540422259
DOIs	https://doi.org/10.1007/3-540-45535-3_19
Publication status	Published - 1 Jan 2001
Event	8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001 - Utrecht, Netherlands Duration: 13 Jun 2001 → 15 Jun 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2081
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001
Country/Territory	Netherlands
City	Utrecht
Period	13/06/01 → 15/06/01

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 8 Decent Work and Economic Growth

Access to Document

10.1007/3-540-45535-3_19

Persistent URL (handle)

Persistent link

Cite this

Hordijk, A., & van der Laan, D. A. (2001). Bounds for deterministic periodic routing sequences. In K. Aardal, & B. Gerards (Eds.), Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings (pp. 236-250). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2081). Springer Verlag. https://doi.org/10.1007/3-540-45535-3_19

Hordijk, A. ; van der Laan, D. A. / Bounds for deterministic periodic routing sequences. Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings. editor / Karen Aardal ; Bert Gerards. Springer Verlag, 2001. pp. 236-250 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@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",

}

Hordijk, A & van der Laan, DA 2001, Bounds for deterministic periodic routing sequences. in K Aardal & B Gerards (eds), Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2081, Springer Verlag, pp. 236-250, 8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001, Utrecht, Netherlands, 13/06/01. https://doi.org/10.1007/3-540-45535-3_19

Bounds for deterministic periodic routing sequences. / Hordijk, A.; van der Laan, D. A.
Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings. ed. / Karen Aardal; Bert Gerards. Springer Verlag, 2001. p. 236-250 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2081).

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Bounds for deterministic periodic routing sequences

AU - Hordijk, A.

AU - van der Laan, D. A.

PY - 2001/1/1

Y1 - 2001/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84947256639

UR - https://www.scopus.com/pages/publications/84947256639#tab=citedBy

U2 - 10.1007/3-540-45535-3_19

DO - 10.1007/3-540-45535-3_19

M3 - Conference contribution

AN - SCOPUS:84947256639

SN - 3540422250

SN - 9783540422259

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 236

EP - 250

BT - Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings

A2 - Aardal, Karen

A2 - Gerards, Bert

PB - Springer Verlag

T2 - 8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001

Y2 - 13 June 2001 through 15 June 2001

ER -

Hordijk A, van der Laan DA. Bounds for deterministic periodic routing sequences. In Aardal K, Gerards B, editors, Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings. Springer Verlag. 2001. p. 236-250. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45535-3_19

Bounds for deterministic periodic routing sequences

Abstract

Publication series

Conference

UN SDGs

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this