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.
- Sprache
-
Englisch
- Erschienen in
-
Series: Tinbergen Institute Discussion Paper ; No. 01-107/4
- Klassifikation
-
Wirtschaft
- Thema
-
Warteschlangentheorie
Theorie
- Ereignis
-
Geistige Schöpfung
- (wer)
-
van Dijk, Nico M.
van der Sluis, Erik
- Ereignis
-
Veröffentlichung
- (wer)
-
Tinbergen Institute
- (wo)
-
Amsterdam and Rotterdam
- (wann)
-
2001
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:43 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Arbeitspapier
Beteiligte
- van Dijk, Nico M.
- van der Sluis, Erik
- Tinbergen Institute
Entstanden
- 2001
Ähnliche Objekte (12)
Simple bounds for transaction costs
Affirmative Priority Queueing
Introduction to queueing theory
Stability of queueing networks
Stochastic processes in queueing theory
Two-dimensional overflow queueing systems
Queueing Theory in a World where most Queueing Problems are Solved by Simulation (Keynote)
Action Spectroscopy of Strongly Bound Clusters in the Gas Phase
Queueing systems with rationally inattentive customers
Bayesian nonparametric inference for queueing systems
Controlled queueing systems with heterogeneous servers
A queueing model of visual search
Simple bounds for transaction costs
Affirmative Priority Queueing
Introduction to queueing theory
Stability of queueing networks
Stochastic processes in queueing theory
Two-dimensional overflow queueing systems
Queueing Theory in a World where most Queueing Problems are Solved by Simulation (Keynote)
Action Spectroscopy of Strongly Bound Clusters in the Gas Phase
Queueing systems with rationally inattentive customers
Bayesian nonparametric inference for queueing systems
Controlled queueing systems with heterogeneous servers
A queueing model of visual search
Simple bounds for transaction costs
Affirmative Priority Queueing
Introduction to queueing theory
Stability of queueing networks
Stochastic processes in queueing theory
Two-dimensional overflow queueing systems
Queueing Theory in a World where most Queueing Problems are Solved by Simulation (Keynote)
Action Spectroscopy of Strongly Bound Clusters in the Gas Phase
Queueing systems with rationally inattentive customers
Bayesian nonparametric inference for queueing systems
Controlled queueing systems with heterogeneous servers