Bounds for deterministic periodic routing sequences

A. Hordijk, D. A. van der Laan

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-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 languageEnglish
Title of host publicationInteger Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings
EditorsKaren Aardal, Bert Gerards
PublisherSpringer Verlag
Pages236-250
Number of pages15
ISBN (Print)3540422250, 9783540422259
DOIs
Publication statusPublished - 1 Jan 2001
Event8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001 - Utrecht, Netherlands
Duration: 13 Jun 200115 Jun 2001

Publication series

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

Conference

Conference8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001
CountryNetherlands
CityUtrecht
Period13/06/0115/06/01

Fingerprint

Dive into the research topics of 'Bounds for deterministic periodic routing sequences'. Together they form a unique fingerprint.

Cite this