Arbeitspapier

Simple Product-Form Bounds for Queueing Networks with Finite Clusters

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.

Language
Englisch

Bibliographic citation
Series: Tinbergen Institute Discussion Paper ; No. 01-107/4

Classification
Wirtschaft
Subject
Warteschlangentheorie
Theorie

Event
Geistige Schöpfung
(who)
van Dijk, Nico M.
van der Sluis, Erik
Event
Veröffentlichung
(who)
Tinbergen Institute
(where)
Amsterdam and Rotterdam
(when)
2001

Handle
Last update
10.03.2025, 11:43 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Arbeitspapier

Associated

  • van Dijk, Nico M.
  • van der Sluis, Erik
  • Tinbergen Institute

Time of origin

  • 2001

Other Objects (12)