Buffer allocation for an integer nonlinear network design problem

DOI10.1016/S0305-0548(96)00068-8MaRDI QIDQ1362945zbMATH OpenOpenAlexFDO

Authors Ajay Singh, James MacGregor Smith

Publication date 10 March 1998

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

Full work available at URL https://doi.org/10.1016/s0305-0548(96)00068-8

zbMATH Keywords

\(M/M/C/K\) queueing stationsBuffer allocation problemsplit topologiessub-optimal solutions

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• Buffer allocation in general single-server queueing networks
• Combining routing and buffer allocation problems in series-parallel queueing networks
• Buffer allocation for a class of nonlinear stochastic knapsack problems
• The optimal buffer allocation problem
• Buffer and server allocation in general multi-server queueing networks

Cites work

• scientific article; zbMATH DE number 4076264 (Why is no real title available?)
• scientific article; zbMATH DE number 3666517 (Why is no real title available?)
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 3405688 (Why is no real title available?)
• An Approximation Method for Open Restricted Queueing Networks
• An Approximation Method for Tandem Queues with Blocking
• An algorithm for sub-optimal routeing in series-parallel queueing networks
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• An empirical investigation of the two-moment approximation for production lines
• Approximate Analysis of General Queuing Networks by Decomposition
• Approximate analysis of exponential queueing systems with blocking
• Asymptotic behavior of the expansion method for open finite queueing networks
• Buffer allocation for a class of nonlinear stochastic knapsack problems
• Congestion in Blocking Systems-A Simple Approximation Technique
• Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
• Generalized \(M/G/C/C\) state dependent queueing models and pedestrian traffic flows
• Heuristic algorithms for buffer allocation in a production line with unreliable machines
• Open finite queueing networks with \(M/M/C/K\) parallel servers
• Simple Bounds for Finite Single-Server Exponential Tandem Queues
• Simple bounds and monotonicity results for finite multi-server exponential tandem queues
• The behaviour of a single queue in a general queueing network
• The generalized expansion method for open finite queueing networks
• The use of decomposition techniques for the analysis of open restricted queuing networks
• Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room

Cited in

(7)

• Optimal buffer allocation in finite closed networks with multiple servers
• Combining routing and buffer allocation problems in series-parallel queueing networks
• Buffer allocation in flow-shop-type production systems with general arrival and service patterns
• Buffer allocation for a class of nonlinear stochastic knapsack problems
• Buffer dimensioning and control stations positioning with a space partitioning-tabu search approach
• Optimal configuration of a decentralized, market-driven production/inventory system
• An analytic finite capacity queueing network model capturing the propagation of congestion and blocking

This page was built for publication: Buffer allocation for an integer nonlinear network design problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362945)