Results 291 to 300 of about 335,294 (339)
Some of the next articles are maybe not open access.
Journal of Applied Probability, 1966
The more one studies the vast and ever-growing literature of the theory of queues, the more one is bewildered by the wide variety of mathematical techniques which different authors have used to analyse the same or similar problems. And yet it seems that, beneath the superficial diversity, there is a deeper unity obscured by the special devices and ...
openaire +4 more sources
The more one studies the vast and ever-growing literature of the theory of queues, the more one is bewildered by the wide variety of mathematical techniques which different authors have used to analyse the same or similar problems. And yet it seems that, beneath the superficial diversity, there is a deeper unity obscured by the special devices and ...
openaire +4 more sources
Journal of Applied Probability, 1969
A “correlated queue” is defined to be a queueing model in which the arrival pattern influences the service pattern or vice versa. A particular model of this nature is considered in this paper. It is such that the service time of a customer is directly proportional to the interval between his own arrival and that of his predecessor.
N. Hadidi, B.W. Conolly
openaire +3 more sources
A “correlated queue” is defined to be a queueing model in which the arrival pattern influences the service pattern or vice versa. A particular model of this nature is considered in this paper. It is such that the service time of a customer is directly proportional to the interval between his own arrival and that of his predecessor.
N. Hadidi, B.W. Conolly
openaire +3 more sources
Finite Queues and Cyclic Queues
Operations Research, 1960The finite queue problem, for which tables exist [Peck, L. G., R. N. Hazelwood. 1958. Finite Queuing Tables. ORSA Publications in Operations Research No. 2. Wiley, New York.], is a special case of the cyclic queue [Koenigsberg, E. 1958. Oper. Res. Quart. 9 22–35].
openaire +2 more sources
Queue Length Dependent Priority Queues
Management Science, 1971Priority rules that are mixtures of pre-emption and postponable rules are analyzed. Whether a pre-emption occurs is made to depend on some factor in addition to priority class. A lower priority customer is pre-empted if and only if the queue length of higher priority customers is N, a decision parameter.
openaire +2 more sources
Biometrika, 1957
In dealing with problems of queueing, several writers (Kolmogoroff, 1932; Erlang*; Kendall, 1951, 1953; Lindley, 1952; Takacs, 1955) have discussed the situation where queue stability is obtained by assuming that the demand for service does not overload the service mechanism.
openaire +2 more sources
In dealing with problems of queueing, several writers (Kolmogoroff, 1932; Erlang*; Kendall, 1951, 1953; Lindley, 1952; Takacs, 1955) have discussed the situation where queue stability is obtained by assuming that the demand for service does not overload the service mechanism.
openaire +2 more sources
Health Care Management Science, 2002
We draw attention to a bibliography on the application of queueing theory in health care and medicine.
openaire +2 more sources
We draw attention to a bibliography on the application of queueing theory in health care and medicine.
openaire +2 more sources
SIAM Journal on Matrix Analysis and Applications, 1997 Summary: For a queueing system with a low traffic intensity, the expected number of customers in the queue is small. However, with a bursty input process, long queues may build up in a short time. We study light traffic queueing systems with bursty input processes. We study the distributions of queue lengths, waiting times, busy and active periods, and
Qi-Ming He, Marcel F. Neuts
openaire +1 more source
Tandem Queues and Queueing Networks
2016Markov processes are a special class of stochastic processes. In order to fully understand Markov processes we first need to introduce stochastic processes. However, to help us understand stochastic process we need to remember the basic probability theory associated with it, which was briefly reviewed in the last chapter.
Attahiru Sule Alfa, Attahiru Sule Alfa
openaire +2 more sources
Management Science, 1966
There are numerous queueing situations in which those awaiting service may be allowed to make choices which affect the time spent in the service system. In such cases, it should be possible to formulate a “strategy” for customers to follow in order to optimize a given parameter. A whole class of queue problems which involve “jockeying” can be regarded
openaire +2 more sources
There are numerous queueing situations in which those awaiting service may be allowed to make choices which affect the time spent in the service system. In such cases, it should be possible to formulate a “strategy” for customers to follow in order to optimize a given parameter. A whole class of queue problems which involve “jockeying” can be regarded
openaire +2 more sources
Nonstationary analysis of the loss queue and of queueing networks of loss queues
European Journal of Operational Research, 2009Abstract We present an iterative scheme based on the fixed-point approximation method, for the numerical calculation of the time-dependent mean number of customers and blocking probability functions in a nonstationary queueing network with multi-rate loss queues. We first show how the proposed method can be used to analyze a single-class, multi-class,
Harry G. Perros, Khalid Alnowibet
openaire +2 more sources