Optimal buffer allocation in finite closed networks with multiple servers

Authors:
Mustafa Yuzukirmizi;J. MacGregor Smith
Affiliations:
Department of Industrial Engineering, Kirikkale University, Yahsihan Kirikkale, Turkey;Department of Mechanical and Industrial Engineering, University of Massachusetts Amherst, MA 01003, USA
Venue:
Computers and Operations Research
Year:
2008

Citing 14
Cited 1

Fundamentals of queueing theory (2nd ed.).

Fundamentals of queueing theory (2nd ed.).
Operations research: principles and practice, 2nd ed.

Operations research: principles and practice, 2nd ed.
Optimal server allocation in a system of multi-server stations

Management Science
Asymptotic behavior of the expansion method for open finite queueing networks

Computers and Operations Research
Buffer space allocation in automated assembly lines

Operations Research
Open finite queueing networks with M/M/C/K parallel servers

Computers and Operations Research
Buffer size optimization in asynchronous assembly systems using genetic algorithms

Computers and Industrial Engineering
Buffer allocation for an integer nonlinear network design problem

Computers and Operations Research
`` Direct Search'' Solution of Numerical and Statistical Problems

Journal of the ACM (JACM)
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

Journal of the ACM (JACM)
Buffer allocation in flow-shop-type production systems with general arrival and service patterns

Computers and Operations Research
Appia: Automatic Storage Area Network Fabric Design

FAST '02 Proceedings of the Conference on File and Storage Technologies
Manufacturing analysis and control: buffer allocation model based on a single simulation

Proceedings of the 35th conference on Winter simulation: driving innovation
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Approximating the buffer allocation problem using epochs

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this study, we present an optimal buffer allocation procedure for closed queueing networks with finite buffers. The performance measures are evaluated using the expanded mean value analysis, and the solution procedure is incorporated into a nonlinear optimization scheme to arrive at the sub-optimal buffer space vector. The effectiveness of the method is demonstrated through several numerical experiments. Discussions on convergence and computational complexity are also included.