New throughput bounds for closed networks

James R. Morrison, P. R. Kumar

Research output: Contribution to journalConference articlepeer-review


A new approach to obtaining performance bounds in closed reentrant lines based on an inequality relaxation of the average cost equation is presented. The approach consists of choosing certain simple functions to serve as a surrogate for the differential cost function. Appealing to the transition invariance of a Markov chain modeling the line one can deduce linear programs which provide performance bounds. Functional bounds and an efficiency test are obtained by proposing a functional form for the surrogate of the differential cost function. We develop the linear program bounds for the class of buffer priority policies.

Original languageEnglish
Pages (from-to)1033-1038
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - 1999
EventThe 38th IEEE Conference on Decision and Control (CDC) - Phoenix, AZ, USA
Duration: Dec 7 1999Dec 10 1999


Dive into the research topics of 'New throughput bounds for closed networks'. Together they form a unique fingerprint.

Cite this