(1) Department of Management Sciences, University of Waterloo, N2L 3G1 Waterloo, Ontario, Canada;(2) Faculty of Administrative Studies, York University, M3J 1P3 North York, Ontario, Canada
Abstract:
A general throughput property of tandem queueing networks with blocking that relates existing decomposition methods to throughput bounds is discussed using the sample path approach.