Buffer allocation for an integer nonlinear network design problem

Cites Work

Title not available (Why is that?)
An efficient method for finding the minimum of a function of several variables without calculating derivatives
Generalized \(M/G/C/C\) state dependent queueing models and pedestrian traffic flows
Simple Bounds for Finite Single-Server Exponential Tandem Queues
Asymptotic behavior of the expansion method for open finite queueing networks
Title not available (Why is that?)
Title not available (Why is that?)
Approximate Analysis of General Queuing Networks by Decomposition
An empirical investigation of the two-moment approximation for production lines
Heuristic algorithms for buffer allocation in a production line with unreliable machines
Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
The generalized expansion method for open finite queueing networks
Approximate analysis of exponential queueing systems with blocking
An Approximation Method for Tandem Queues with Blocking
Congestion in Blocking Systems-A Simple Approximation Technique
An Approximation Method for Open Restricted Queueing Networks
Simple bounds and monotonicity results for finite multi-server exponential tandem queues
The behaviour of a single queue in a general queueing network
Buffer allocation for a class of nonlinear stochastic knapsack problems
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
Title not available (Why is that?)
Open finite queueing networks with \(M/M/C/K\) parallel servers
An algorithm for sub-optimal routeing in series-parallel queueing networks

Cited In (7)

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

   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 👍 👎

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)