Yüzükırmızı, MustafaSmith, JM2020-06-252020-06-252006closedAccess0166-5316https://doi.org10.1016/j.peva.2005.05.004https://hdl.handle.net/20.500.12587/3797We present a new class of finite queues in cyclic networks with production blocking. We show that with a threshold property related to the number of customers in the network, these queues are insensitive to the allocation of buffers and the order of the stations. In addition, some simple and practical, yet effective approximations are presented. Numerical examples have been carried out to demonstrate the efficacy of the approaches. (c) 2005 Elsevier B.V. All rights reserved.eninfo:eu-repo/semantics/closedAccesscyclic queuesclosed queueingnetworksthreshold propertyArticle634-546349210.1016/j.peva.2005.05.0042-s2.0-33144470053Q2WOS:000236425200010Q2