Approximate Analysis of General Queuing Networks by Decomposition

Cited in

(70)

Describing processing time when simulating JIT environments
Buffer allocation for an integer nonlinear network design problem
Tandem behavior of a telecommunication system with repeated calls. II: A general case without buffers
Tractable stochastic analysis in high dimensions via robust optimization
Analytical approximations to predict performance measures of Markovian type manufacturing systems with job failures and parallel processing
Approximate analysis of load-dependent generally distributed queuing networks with low service time variability
Higher order approximations for tandem queueing networks
A hybrid method for performance analysis of \(G/G/m\) queueing networks
A unified framework for approximation of general telecommunication networks
Open finite queueing networks with \(M/M/C/K\) parallel servers
The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes
Analysis of a finite capacity assembly system
Theory of queuing networks and its applications to the analysis of information-computing systems
Capacity planning with congestion effects
Taking account of correlations between streams in queueing network approximations
The interdeparture-time distribution for each class in the \(\Sigma _ iM_ i/G_ i/1\) queue
Approximating the departure and the overflow processes from aG/G/Kloss system
Approximating the tandem behaviour of a G|M|1 queueing system
Markovian approximations for a grid computing network with a ring structure
MODELING TRAFFIC FLOWS WITH QUEUEING MODELS: A REVIEW
Discrete-time approximation of the machine interference problem with generally distributed failure, repair, and walking times
A new method for analysing the equilibrium and time-dependent behaviour of Markovian models
Asymptotically exact decomposition approximations for open queueing networks
A robust queueing network analyzer based on indices of dispersion
Robust queueing theory
Evaluation of the performance parameters of a closed queuing network using artificial neural networks
Modeling and optimization of buffers and servers in finite queueing networks
Tandem behavior of a finite capacity G/M/1 queueing system: An algorithm
Travel times in queueing networks and network sojourns
Operating a flexible assembly line: To control the bottleneck
Traffic allocation for manufacturing systems
Approximate transient analysis of queuing networks by quasi product forms
Analytical approximations to predict performance measures of manufacturing systems with general distributions, job failures and parallel processing
Setting defect charts control limits to balance cycle time and yield for a tandem production line
An approximate analysis of open tandem queueing networks with blocking and general service times
The QNET method for two-moment analysis of open queueing networks
Mean sojourn times in two-queue fork-join systems: bounds and approximations
A review of open queueing network models of manufacturing systems
Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
An optimal policy for controlling the flow time in an assembly line system
An assembly cell with and automated quality control station. Exponentially distributed processing times
Optimal selection of buffers in a tandem finite capacity G/M/1 queueing system
MRE hierarchical decomposition of general queueing network models
Approximate analysis for queueing networks with finite capacity and customer loss
Performance analysis of single stage kanban controlled production systems using parametric decomposition
Diffusion parameters of flows in stable multi-class queueing networks
An analytical solution for the discrete time single server system with semi-Markovian arrivals
Buffer allocation in flow-shop-type production systems with general arrival and service patterns
Performance analysis of a batch service queue arising out of manufacturing system modelling
A stochastic recirculation system with random access
Capacity planning in manufacturing networks with discrete options
Asymptotic behavior of the expansion method for open finite queueing networks
Characterization of the departure process from anME/ME/1queue
Performance analysis of virtual circuit connections for bursty data sources in ATM networks
Performance analysis of an ISDN switch with distributed architecture: Circuit switched calls
Qeueing models for performance analysis: Selection of single station models
Tandem behaviour of a finite-capacity G/M/1 queueing system with instantaneous Bernoulli feedback: an algorithm
Towards better multi-class parametric-decomposition approximations for open queueing networks
Approximation of the departure processes from G/M/1/K and M/G/1/K queueing systems
The heavy-traffic bottleneck phenomenon under splitting and superposition
Conditional inter-departure times from the M/G/s queue
Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
System planning and configuration problems for optimal system design
Analysis and design of rate-based congestion control of high speed networks. I: Stochastic fluid models, access regulation
A spreadsheet model approach for integrating static capacity planning and stochastic queueing models
Higher order approximations for the single server queue with splitting, merging and feedback
Point and interval estimation of decomposition error in discrete-time open tandem queues
The generalized expansion method for open finite queueing networks
Lot size optimisation under pooled and unpooled scenarios in batch production system
Tandem behavior of a telecommunication system with finite buffers and repeated calls

This page was built for publication: Approximate Analysis of General Queuing Networks by Decomposition

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