Production systems with interruptions, arbitrary topology and finite buffers

We consider a production system with finite buffers and arbitrary topology where service time is subject to interruptions in one of three ways, viz. m achine breakdown, machine vacations or N-policy. We develop a unified appro ximation (analytical) methodology to calculate the throughput of the system using queueing networks together with decomposition, isolation and expansi on techniques. The methodology is rigorously tested covering a large experi mental region. Orthogonal arrays are used to design the experiments in orde r to keep the number of experiments manageable. The results obtained using the approximation methodology are compared to the simulation results. The t -tests carried out to investigate the differences between the two results s how that they are statistically insignificant. Finally, we test the methodo logy by applying it to several arbitrary topology networks. The results sho w that the performance of the approximation methodology is consistent, robu st and produces excellent results in a variety of experimental conditions.