Optimal buffer allocation in finite closed networks with multiple servers

DOI10.1016/j.cor.2006.12.008zbMath1180.90042OpenAlexW1968859358MaRDI QIDQ2471231

Mustafa Yuzukirmizi, James MacGregor Smith

Publication date: 22 February 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.12.008

zbMATH Keywords

combinatorial optimizationfinite closed queueing networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Combinatorial optimization (90C27)

Related Items (6)

Two approaches for solving the buffer allocation problem in unreliable production lines ⋮ Optimization of buffer allocation in unreliable production lines based on availability evaluation ⋮ Approximating the buffer allocation problem using epochs ⋮ Unnamed Item ⋮ Time value of delays in unreliable production systems with mixed uncertainties of fuzziness and randomness ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The generalized expansion method for open finite queueing networks
• Asymptotic behavior of the expansion method for open finite queueing networks
• Open finite queueing networks with \(M/M/C/K\) parallel servers
• Buffer allocation for an integer nonlinear network design problem
• Combining routing and buffer allocation problems in series-parallel queueing networks
• Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers
• Buffer allocation for a class of nonlinear stochastic knapsack problems
• Efficient algorithms for buffer space allocation
• A simulated annealing approach for buffer allocation in reliable production lines
• A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines
• Optimal Server Allocation in a System of Multi-Server Stations
• `` Direct Search Solution of Numerical and Statistical Problems
• Tabu Search—Part I
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• An upper bound for carriers in a three-workstation closed serial production system operating under production blocking
• A New Method of Constrained Optimization and a Comparison With Other Methods
• Buffer allocation in flow-shop-type production systems with general arrival and service patterns

This page was built for publication: Optimal buffer allocation in finite closed networks with multiple servers