Topological network design of general, finite, multi-server queueing networks
type: Item
instance of: scholarly article
title: Topological network design of general, finite, multi-server queueing networks
zbMATH Open document ID: 1175.90114
author: James MacGregor Smith
author: F. R. B. Cruz
author: Tom Van Woensel
published in: European Journal of Operational Research
publication date: 2009-11-16T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5633672
zbMATH Keywords: manufacturing
zbMATH Keywords: multi-server systems
zbMATH Keywords: network design
zbMATH Keywords: buffer allocation
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.03.012
OpenAlex ID: W2144991714
cites work: A two-moment approximation for the \(GI/G/c\) queue with finite capacity
cites work: Buffer allocation in general single-server queueing networks
cites work: On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks
cites work: Manufacturing flow line systems: A review of models and analytical results
cites work: Topology related index for performance comparison of blocking symmetrical networks
cites work: Model for cost estimation in a finite-capacity stochastic environment based on shop floor optimization combined with simulation
cites work: Approximate Models for Processor Utilization in Multiprogrammed Computer Systems
cites work: On Approximate Computer System Models
cites work: On the Capacity of Tandem Server, Finite Queue, Service Systems
cites work: Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
cites work: Q3671858
cites work: Q3863412
cites work: The generalized expansion method for open finite queueing networks
cites work: Asymptotic behavior of the expansion method for open finite queueing networks
cites work: Transform-free analysis of the \(GI/G/1/K\) queue through the decomposed little's formula
cites work: Optimal buffer design of an m/g/s queue with finite capacity∗
cites work: A Transform-Free Approximation for the Finite Capacity M/G/s Queue
cites work: Q4101255
cites work: The omnipresence of Lagrange
cites work: The throughput rate of three-station production lines: a unifying solution
cites work: A statistical process control approach to selecting a warm-up period for a discrete-event simulation
cites work: Evaluating the Overflow Probability Using the Infinite Queue
cites work: Buffer overflow calculations using an infinite-capacity model
cites work: Heuristic algorithms for buffer allocation in a production line with unreliable machines
cites work: Optimal design and performance modelling of \(M/G/1/K\) queueing systems
cites work: Buffer allocation for a class of nonlinear stochastic knapsack problems
cites work: Large production line optimization using simulated annealing
cites work: Q4851818
cites work: Allocation of buffer capacities in queueing networks with arbitrary topologies
cites work: Queueing models for a flexible machining station. I: The diffusion approximation
DOI: 10.1016/J.EJOR.2009.03.012
description: scientific article; zbMATH DE number 5633672