Bounds for Deterministic Periodic Routing sequences

  • A. Hordijk
  • D. A. van der Laan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2081)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • A. Hordijk
    • 1
  • D. A. van der Laan
    • 1
  1. 1.Mathematical InstituteLeiden UniversityLeidenThe Netherlands

Personalised recommendations