Buffer allocation for an integer nonlinear network design problem
From MaRDI portal
Publication:1362945
DOI10.1016/S0305-0548(96)00068-8zbMath0882.90051OpenAlexW2094438124MaRDI QIDQ1362945
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
Related Items (4)
Optimal configuration of a decentralized, market-driven production/inventory system ⋮ Optimal buffer allocation in finite closed networks with multiple servers ⋮ Buffer allocation in flow-shop-type production systems with general arrival and service patterns ⋮ An analytic finite capacity queueing network model capturing the propagation of congestion and blocking
Cites Work
- Unnamed Item
- 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
- Simple bounds and monotonicity results for finite multi-server exponential tandem queues
- Approximate analysis of exponential queueing systems with blocking
- The use of decomposition techniques for the analysis of open restricted queuing networks
- The behaviour of a single queue in a general queueing network
- Open finite queueing networks with \(M/M/C/K\) parallel servers
- Generalized \(M/G/C/C\) state dependent queueing models and pedestrian traffic flows
- Buffer allocation for a class of nonlinear stochastic knapsack problems
- An Approximation Method for Tandem Queues with Blocking
- Simple Bounds for Finite Single-Server Exponential Tandem Queues
- Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room
- Congestion in Blocking Systems-A Simple Approximation Technique
- An Approximation Method for Open Restricted Queueing Networks
- Approximate Analysis of General Queuing Networks by Decomposition
- An algorithm for sub-optimal routeing in series-parallel queueing networks
- An empirical investigation of the two-moment approximation for production lines
- Heuristic algorithms for buffer allocation in a production line with unreliable machines
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
This page was built for publication: Buffer allocation for an integer nonlinear network design problem
