In this paper we consider closed queueing networks havingMsingle server queueing stations with arbitrary interconnections and general service time distributions. Here we propose an iterative approximation procedure, based on a decomposition approximation. Numerical results are reported to demonstrate the accuracy of the method. We also discuss the sensitivity of the results to the initial guess for the server utilizations.