Journal Article10.1287/OPRE.28.3.594
An Approximation Method for Open Restricted Queueing Networks
TL;DR: It is found that this method provides a fairly good approximation procedure for obtaining system performance measures such as blocking probabilities, output rates, etc., in open restricted queueing networks.
read more
Abstract: This paper presents an approximation method for analyzing open restricted queueing networks with exponential service time and Poisson arrivals. Analysis is made by node-by-node decomposition through the introduction of a pseudo-arrival rate and an effective service rate. The method is applied to example networks and evaluated by comparing the results obtained thereby with those by simulations or exact calculations. We find that this method provides a fairly good approximation procedure for obtaining system performance measures such as blocking probabilities, output rates, etc., in open restricted queueing networks.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking
TL;DR: This paper presents an efficient method for evaluating performance measures for a class of tandem queueing systems with finite buffers in which blocking and starvation are important and based on system characteristics such as conservation of flow.
Queueing theory in manufacturing: A survey
Manish K. Govil,Michael C. Fu +1 more
TL;DR: The survey classifies the contributions into two groups: descriptive (performance analysis) and generative (design, planning, and control) and software based on analytical models in queueing theory, as applied to manufacturing.
198
An analytic finite capacity queueing network model capturing the propagation of congestion and blocking
Carolina Osorio,Michel Bierlaire +1 more
TL;DR: An analytic queueing network model which preserves the finite capacity of the queues and uses structural parameters to grasp the between-queue correlation and is applied to study patient flow in a network of units of the Geneva University Hospital.
175
Approximate analysis of exponential tandem queues with blocking
TL;DR: An approximate method for the analysis of open networks of queues in tandem and with blocking is proposed, based on the method of decomposition where the total network is broken down into queues which are analyzed as M/C2/1/N queues assuming Poisson arrival and departure processes.
143
Chapter 5 Performance evaluation of production networks
Rajan Suri,Jerry L. Sanders,Manjunath Kamath +2 more
- 01 Jan 1993
TL;DR: This chapter discusses different approaches to performance evaluation (PE) of discrete manufacturing systems that can be placed in three categories: static (allocation) models, aggregate dynamic models (ADMs), and detailed dynamic models.
141
References
Networks of Waiting Lines
TL;DR: What is perhaps the simplest theoretical question related to this class of problems, and derives expressions for certain steady-state parameters for discrete, statistically varying flows through complex networks.
1.2K
Computational algorithms for closed queueing networks with exponential servers
TL;DR: Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers based on two-dimensional iterative techniques which are highly efficient and quite simple to implement.
Closed Queuing Systems with Exponential Servers
TL;DR: It is found that the distribution of customers in the closed queuing system is regulated by the stage or stages with the slowest effective service rate, which means that closed systems are shown to be stochastically equivalent to open systems in which the number of customers cannot exceed N.
715
Finite Queues in Series with Exponential or Erlang Service Times-A Numerical Approach
TL;DR: In this article, the authors considered a queuing system consisting of N service channels in series where each channel has an exponential or Erlang holding time and except for the first channel a finite queue, and where the input process is such that the first queue is never empty.
311