Buffer allocation in general single-server queueing networks

Authors:
F. R. B. Cruz;A. R. Duarte;T. van Woensel
Affiliations:
Department of Statistics, Federal University of Minas Gerais, 31270-901 Belo Horizonte, MG, Brazil;Department of Statistics, Federal University of Minas Gerais, 31270-901 Belo Horizonte, MG, Brazil;Department of Operations, Planning Accounting and Control, Eindhoven University of Technology, Eindhoven, The Netherlands
Venue:
Computers and Operations Research
Year:
2008

Citing 7
Cited 3

Fundamentals of queueing theory (2nd ed.).

Fundamentals of queueing theory (2nd ed.).
Stochastic modelling and analysis: a computational approach

Stochastic modelling and analysis: a computational approach
Buffer space allocation in automated assembly lines

Operations Research
On Approximate Computer System Models

Journal of the ACM (JACM)
Simulation with Arena

Simulation with Arena
M/G/c/K blocking probability models and system performance

Performance Evaluation
Approximate analysis of M/G/c/c state-dependent queueing networks

Computers and Operations Research

Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization

Computers and Operations Research
Performance optimization of open zero-buffer multi-server queueing networks

Computers and Operations Research
An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the constraints or both are usually not available in closed form, making the problem even harder. A good approximation for the performance measures is thus essential for a successful buffer allocation algorithm. A recently published two-moment approximation formula to obtain the optimal buffer allocation in general service time single queues is examined in detail, based on which a new algorithm is proposed for the buffer allocation in single-server general service time queueing networks. Computational results and simulation results are shown to evaluate the efficacy of the approach in generating optimal buffer allocation patterns.