Topological network design of general, finite, multi-server queueing networks
From MaRDI portal
Publication:1037668
DOI10.1016/j.ejor.2009.03.012zbMath1175.90114OpenAlexW2144991714MaRDI QIDQ1037668
James MacGregor Smith, Tom Van Woensel, Frederico R. B. Cruz
Publication date: 16 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.03.012
Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Related Items (6)
Modeling of throughput in production lines using response surface methodology and artificial neural networks ⋮ Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers ⋮ A hybrid method for performance analysis of \(G/G/m\) queueing networks ⋮ Buffer and server allocation in general multi-server queueing networks ⋮ Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks ⋮ Server allocation for zero buffer tandem queues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The generalized expansion method for open finite queueing networks
- Queueing models for a flexible machining station. I: The diffusion approximation
- Model for cost estimation in a finite-capacity stochastic environment based on shop floor optimization combined with simulation
- On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks
- Asymptotic behavior of the expansion method for open finite queueing networks
- Manufacturing flow line systems: A review of models and analytical results
- Buffer overflow calculations using an infinite-capacity model
- Allocation of buffer capacities in queueing networks with arbitrary topologies
- Topology related index for performance comparison of blocking symmetrical networks
- Optimal design and performance modelling of \(M/G/1/K\) queueing systems
- Transform-free analysis of the \(GI/G/1/K\) queue through the decomposed little's formula
- Buffer allocation for a class of nonlinear stochastic knapsack problems
- A statistical process control approach to selecting a warm-up period for a discrete-event simulation
- Buffer allocation in general single-server queueing networks
- A Two-Moment Approximation for the GI/G/c Queue with Finite Capacity
- The throughput rate of three-station production lines: a unifying solution
- On Approximate Computer System Models
- Evaluating the Overflow Probability Using the Infinite Queue
- A Transform-Free Approximation for the Finite Capacity M/G/s Queue
- Heuristic algorithms for buffer allocation in a production line with unreliable machines
- Large production line optimization using simulated annealing
- Approximate Models for Processor Utilization in Multiprogrammed Computer Systems
- Optimal buffer design of an m/g/s queue with finite capacity∗
- On the Capacity of Tandem Server, Finite Queue, Service Systems
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- The omnipresence of Lagrange
This page was built for publication: Topological network design of general, finite, multi-server queueing networks
