Buffer allocation in general single-server queueing networks
From MaRDI portal
Publication:2483503
DOI10.1016/j.cor.2007.03.004zbMath1170.90361MaRDI QIDQ2483503
Publication date: 28 April 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.03.004
90B15: Stochastic network models in operations research
90B22: Queues and service in operations research
Related Items
Topological network design of general, finite, multi-server queueing networks, Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization, Performance optimization of open zero-buffer multi-server queueing networks, Buffer and server allocation in general multi-server queueing networks
Cites Work
- Unnamed Item
- Approximate analysis of \(M/G/c/c\) state-dependent queueing networks
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- Qeueing models for performance analysis: Selection of single station models
- Allocation of buffer capacities in queueing networks with arbitrary topologies
- Buffer allocation for a class of nonlinear stochastic knapsack problems
- On the optimal design of tandem queueing systems with finite buffers
- Multi-objective routing within large scale facilities using open finite queueing networks
- On Approximate Computer System Models
- A Transform-Free Approximation for the Finite Capacity M/G/s Queue
- Large production line optimization using simulated annealing
- Computationally efficient approximations for balanced flowlines with finite intermediate buffers
- Optimal buffer design of an m/g/s queue with finite capacity∗
- The omnipresence of Lagrange
