A parametric decomposition based approach for multi-class closed queuing networks with synchronization stations

Multi-class closed queuing networks with synchronization stations find applications in analytical models of assembly systems and production systems operating under pull control policies. These queuing networks are hard to analyze exactly and therefore approximation methods must be used for performance evaluation. In this research we propose a new efficient approach based on parametric decomposition. Using recent developments in two-moment approximations for fork/join stations, we develop efficient algorithms for general multi-class closed queuing networks with synchronization stations. Numerical studies indicate that the proposed method is computationally efficient and yields fairly accurate results when compared to simulation.