Queueing Systems

, Volume 38, Issue 2, pp 185–194

Conservation Laws for Single-Server Fluid Networks

  • Nicole Bäuerle
  • Shaler Stidham
Article

DOI: 10.1023/A:1010906331066

Cite this article as:
Bäuerle, N. & Stidham, S. Queueing Systems (2001) 38: 185. doi:10.1023/A:1010906331066

Abstract

We consider single-server fluid networks with feedback and arbitrary input processes. The server has to be scheduled in order to minimize a linear holding cost. This model is the fluid analogue of the so-called Klimov problem. Using the achievable-region approach, we show that the Gittins index rule is optimal in a strong sense: it minimizes the linear holding cost for arbitrary input processes and for all time points t≥0.

fluid network achievable-region approach conservation laws Gittins index linear program 

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Nicole Bäuerle
    • 1
  • Shaler Stidham
    • 2
  1. 1.Department of Operations ResearchUniversity of UlmUlmGermany
  2. 2.Department of Operations ResearchUniversity of North CarolinaChapel HillUSA