Showing 1 - 10 of 26
Queueing networks are studied with finite capacity constraints for clusters of stations. First, by an instructive tandem cluster example it is shown how a product-form modification method for networks with finite stations can be extended to networks with finite clusters. Next, a general result...
Persistent link: https://www.econbiz.de/10005281944
This discussion paper resulted in a publication in <A href="http://link.springer.com/article/10.1023/A:1020922315539#page-1">'Annals of Operations Research'</A>.<P> 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...</p></a>
Persistent link: https://www.econbiz.de/10011256101
Persistent link: https://www.econbiz.de/10005257298
Persistent link: https://www.econbiz.de/10008072951
Persistent link: https://www.econbiz.de/10006640839
Persistent link: https://www.econbiz.de/10008215968
Persistent link: https://www.econbiz.de/10004144883
Persistent link: https://www.econbiz.de/10004178496
An approximate version of the standard uniformization technique is introduced for application to continuous-time Markov chains with unbounded jump rates. This technique is shown to be asymptotically exact and an error bound for the order of its accuracy is provided. An illustrative queueing...
Persistent link: https://www.econbiz.de/10008875580
Persistent link: https://www.econbiz.de/10005337659