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...

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>

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...

A finite last-come first-served queueing system is studied with batch input and non-exponential services. A closed form expression is obtained for the steady-state queue length distribution and shown to be insensitive to service distributional forms (i.e. to depend only on mean service times)....

This paper studies the finite horizon Bellman equation for controlled Markov jump models with unbounded jump and cost rates. Under concrete growth conditions on the jump rates a method of time-discretization is used to: (i) prove the existence of a solution, (ii) construct a computationally...