Optimal Routing to Parallel Heterogeneous Servers-Small Arrival Rates

Zvi Rosberg, Armand M. Makowski

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

Consider a set of k(>2) heterogeneous and exponential servers which operate in parallel. Customers arrive into a single infinite capacity buffer according to a Poisson process, and are routed to available servers in accordance with some routing policy. We show that for arrival rates in some positive interval (0, Ao], every routing policy which minimizes the long-run expected holding cost is contained in the set of routing policies that minimize the expected flow time for a system with fixed initial population and no new arrivals.

Original languageEnglish
Pages (from-to)789-796
Number of pages8
JournalIEEE Transactions on Automatic Control
Volume35
Issue number7
DOIs
StatePublished - 1 Jan 1990
Externally publishedYes

Fingerprint

Dive into the research topics of 'Optimal Routing to Parallel Heterogeneous Servers-Small Arrival Rates'. Together they form a unique fingerprint.

Cite this