Random Flow in Queueing Networks: A Review and Critique

Abstract

This paper introduces basic properties of queueing networks. Networks are classified by their queue length vector processes as being Markov processes or not. In each case the relevant problems are exposed and the literature of each problem is surveyed. The paper concludes with a discussion of the results, and some points in need of further research are established.

Allocation of Buffer Capacities for a Class of Fixed Cycle Production Lines

“…For problem #1 both surrogates g and h specify buffer allocations of (3,4,5) and generate a system reliability (simulated for 100,000 cycles) at 331. In [ I 61 eight different alternatives are tested for problem #I, the best of which is (2,3,7). The buffer allocation of (2, 3, 7) provides a system reliability (computed analytically in 1161) of .833.…”

On-line scheduling of a robotic manufacturing cell with stochastic sequence-dependent processing rates

“…(1980), and Lin and Kumar (1984). Disney (1975), Lemoine (1977) and Stidham (1985) survey the methodological research in this area. Many of these studies stress the significant reduction in production flow times which are possible through the use of dynamic assignment strategies.…”

Comparison of Different Confidence Intervals of Intensities for an Open Queueing Network with Feedback

“…It follows from Equation (2) that an estimate of intensity 1  can be calculated from bootstrap samples as…”

“…Intensity 1  and 2  can be interpreted as expected number of arrivals per mean service time. The condition for stability of the system is both 1  , 2  are less unity. Basic properties of queueing networks are introduced in Disney [1].…”

“…The condition for stability of the system is both 1  , 2  are less unity. Basic properties of queueing networks are introduced in Disney [1]. Burke [2], Beautler and Melamed [3] showed that the input process to a service center in a network with feedback is not Poisson in general.…”