Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/86039 
Year of Publication: 
2001
Series/Report no.: 
Tinbergen Institute Discussion Paper No. 01-107/4
Publisher: 
Tinbergen Institute, Amsterdam and Rotterdam
Abstract: 
Queueing networks are studied with finite capacity constraints forclusters of stations. First, by an instructive tandemcluster example it is shown how a product-form modification methodfor networks with finite stations can be extended tonetworks with finite clusters. Next, a general result is establishedby which networks with finite clusters can be studied atcluster level by merely keeping track of the total number of jobs atthese clusters, that is, by regarding these clusters asaggregate stations. This result is of practical interest to concludesimple performance bounds at global network level. Anumber of illustrative examples with numerical support are provided.
Document Type: 
Working Paper

Files in This Item:
File
Size
186.05 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.