Allocation of buffer capacities in queueing networks with arbitrary topologies
type: Item
instance of: scholarly article
title: Allocation of buffer capacities in queueing networks with arbitrary topologies
zbMATH Open document ID: 0816.90063
DOI: 10.1007/BF02024519
author: Hideaki Yamashita
author: Raif O. Onvural
published in: Annals of Operations Research
publication date: 1994-03-10T00:00:00Z
review text: The authors present two algorithms to allocate \(M\) buffers to \(N\) service stations which are connected in a feedforward manner. All service times and the interarrival times are assumed to be exponentially distributed. The algorithms use appropriate decompositions of the network followed by iterative improvements.
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 513140
zbMATH Keywords: service models
zbMATH Keywords: queueing networks
describes a project that uses: MARCA
MaRDI profile type: Publication
cites work: Design of manufacturing systems using queueing models
cites work: Q3343732
cites work: An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
cites work: Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
cites work: On equivalencies of blocking mechanisms in queueing networks with blocking
cites work: Influence of Storage Bin Capacity on the Average Standstill Time of a Production Line
description: scientific article; zbMATH DE number 513140