Monotone control of queueing networks

Research paper by Michael H. Veatch, Lawrence M. Wein

Indexed on: 01 Sep '92Published on: 01 Sep '92Published in: Queueing Systems


This paper uses submodularity to obtain monotonicity results for a class of Markovian queueing network service rate control problems. Nonlinear costs of queueing and service are allowed. In contrast to Weber and Stidham [14], our monotonicity theorem considers arbitrary directions in the state space (not just control directions), arrival routing problems, and certain uncontrolled service rates. We also show that, without service costs, transition-monotone controls can be described by simple control regions and switching functions. The theory is applied to queueing networks that arise in a manufacturing system that produces to a forecast of customer demand, and also to assembly and disassembly networks.