  The paper analyzes the performance of tandem network of polling queue with
setups. For a system with two-products and two-stations, we propose a new
approach based on a partially-collapsible state-space characterization to
reduce state-space complexity. In this approach, the size of the state-space is
varied depending on the information needed to determine buffer levels and
waiting times. We evaluate system performance under different system setting
and comment on the numerical accuracy of the approach as well as provide
managerial insights. Numerical results show that approach yields reliable
estimates of the performance measures. We also show how product and station
asymmetry significantly affect the systems performance.
