Mathematical programming models of closed tandem queueing networks

  • Authors:
  • Wai Kin Victor Chan;Lee W. Schruben

  • Affiliations:
  • Rensselaer Polytechnic Institute, Troy, NY;University of California, Berkeley, CA

  • Venue:
  • ACM Transactions on Modeling and Computer Simulation (TOMACS)
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Closed tandem queueing networks are an important class of queueing models. Common approaches for analyzing these systems include Markov processes, renewal theory, and random walks. This article presents optimization models for sample paths of closed tandem queues. These mathematical models provide a new tool for analyzing these queueing systems using the techniques and algorithms from mathematical programming, and from graph theory in particular. We then apply operators from computer graphics (electronic picture manipulation) to graph theoretic representations of discrete-event system dynamics to establish some fundamental mathematical properties for these queueing systems.