Buffer allocation for an integer nonlinear network design problem
type: Item
instance of: scholarly article
title: Buffer allocation for an integer nonlinear network design problem
zbMATH Open document ID: 0882.90051
DOI: 10.1016/S0305-0548(96)00068-8
author: Ajay Singh
author: James MacGregor Smith
published in: Computers \& Operations Research
publication date: 1998-03-10T00:00:00Z
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 1045733
zbMATH Keywords: sub-optimal solutions
zbMATH Keywords: Buffer allocation problem
zbMATH Keywords: split topologies
zbMATH Keywords: \(M/M/C/K\) queueing stations
MaRDI profile type: Publication
cites work: Buffer allocation for a class of nonlinear stochastic knapsack problems
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: Q4101255
cites work: The use of decomposition techniques for the analysis of open restricted queuing networks
cites work: An Approximation Method for Open Restricted Queueing Networks
cites work: Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
cites work: Approximate analysis of exponential queueing systems with blocking
cites work: An efficient method for finding the minimum of a function of several variables without calculating derivatives
cites work: Q5671796
cites work: An Approximation Method for Tandem Queues with Blocking
cites work: Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room
cites work: Generalized \(M/G/C/C\) state dependent queueing models and pedestrian traffic flows
cites work: Congestion in Blocking Systems-A Simple Approximation Technique
cites work: The behaviour of a single queue in a general queueing network
cites work: An algorithm for sub-optimal routeing in series-parallel queueing networks
cites work: Q3806522
cites work: Q3863412
cites work: Open finite queueing networks with \(M/M/C/K\) parallel servers
cites work: Approximate Analysis of General Queuing Networks by Decomposition
cites work: An empirical investigation of the two-moment approximation for production lines
cites work: Heuristic algorithms for buffer allocation in a production line with unreliable machines
cites work: Simple Bounds for Finite Single-Server Exponential Tandem Queues
cites work: Simple bounds and monotonicity results for finite multi-server exponential tandem queues
full work available at URL: s0305-0548(96)00068-8
OpenAlex ID: W2094438124
description: scientific article; zbMATH DE number 1045733