Buffer allocation for a class of nonlinear stochastic knapsack problems

DOI10.1007/BF02038860MaRDI QIDQ1904725zbMATH OpenFDO

Authors J. McGregor Smith, Nikhil Chikhale

Publication date 7 January 1996

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

sensitivity analysisnetwork designqueueing networksnonlinear, stochastic knapsack problemsoverall buffer constraint

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic programming (90C15) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• Buffer allocation for an integer nonlinear network design problem
• Buffer allocation in general single-server queueing networks
• The stochastic knapsack problem
• Combining routing and buffer allocation problems in series-parallel queueing networks
• A continuous buffer allocation model using stochastic processes

Cites work

• An Approximation Method for Open Restricted Queueing Networks
• An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Approximate analysis of exponential queueing systems with blocking
• Approximate analysis of exponential tandem queues with blocking
• Asymptotic behavior of the expansion method for open finite queueing networks
• Combining routing and buffer allocation problems in series-parallel queueing networks
• Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
• Simple Bounds for Finite Single-Server Exponential Tandem Queues
• Simple bounds and monotonicity results for finite multi-server exponential tandem queues
• The generalized expansion method for open finite queueing networks

Cited in

(6)

• Optimal buffer allocation in finite closed networks with multiple servers
• Buffer allocation in general single-server queueing networks
• Buffer allocation for an integer nonlinear network design problem
• Approximate analysis of \(M/G/c/c\) state-dependent queueing networks
• Topological network design of general, finite, multi-server queueing networks
• Buffer allocation in flow-shop-type production systems with general arrival and service patterns

This page was built for publication: Buffer allocation for a class of nonlinear stochastic knapsack problems

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