Results 251 to 260 of about 42,286 (292)

Departure process in tandem queues

International Journal of Systems Science, 1984
In a system of single-server queues in series, a customer enters the first queue ; he waits till he is served, enters the second queue, and so on. A heuristic method of approximating the distribution function of the inter-departure time through erlangian distribution is presented in this paper.
RAJA GHOSAL, A. GHOSAL
openaire   +1 more source

On Output Processes of Synchronization Queues

International Transactions in Operational Research, 2001
We consider synchronization queues with finite or infinite buffers. There is one flow of tokens for each buffer. The input flow to each buffer, called a stream, is assumed to be a point process with finite intensity. Tokens arriving at each buffer have to wait to form a synchronized group and depart the system. We are concerned with output processes in
openaire   +2 more sources

Allocation Processes with Variable Channel Queues

Management Science, 1973
A dynamic model is formulated for determining optimum operating policies in a variable channel queuing situation. Such policies are required when workers must be allocated to one of several jobs which have associated with them different waiting costs.
openaire   +1 more source

Models of Queueing Processes

1966
There is no science of queueing-processes. A Theory of Queues exists which is concerned with the study of symbolic, mathematical models of queueing-processes, but it appears to be founded on a surprisingly slight body of empirical knowledge. Not many experimental results concerning queueing-processes have so far appeared.
openaire   +1 more source

Filtering of Markov renewal queues, IV: Flow processes in feedback queues

Advances in Applied Probability, 1985
This paper is a continuation of the study of a class of queueing systems where the queue-length process embedded at basic transition points, which consist of ‘arrivals’, ‘departures’ and ‘feedbacks’, is a Markov renewal process (MRP). The filtering procedure of Çinlar (1969) was used in [12] to show that the queue length process embedded separately at ‘
openaire   +1 more source

Queues and Point Processes

Journal of the Operational Research Society, 1983
Rodney Coleman, P. Franken, D. Konig, U. Arndt, V. Schmidt   +4 more
  +4 more sources

A Queueing Process with Some Discrimination

Management Science, 1969
This paper deals with the analysis of a queueing process involving two classes of customers where the arrival mechanism of each class is subject to a particular control doctrine based on the queue length. Expressions are obtained for the equilibrium distribution of the queue length, the expected queue length and other characteristics which measure the
openaire   +1 more source

Comparing counting processes and queues

Advances in Applied Probability, 1981
Several partial orderings of counting processes are introduced and applied to compare stochastic processes in queueing models. The conditions for the queueing comparisons involve the counting processes associated with the interarrival and service times. The two queueing processes being compared are constructed on the same probability space so that each
openaire   +1 more source

Queue tests for renewal processes

Operations Research Letters, 1983
Queuing models can be used to test whether a stochastic point process can be represented as a renewal process. The test queuing model is analyzed, perhaps by simulation, using the prrocess of interest to generate arrivals or service times. Various congestion measures indicate departure from the renewal property.
openaire   +2 more sources

Queueing processes with accumulated service

Annals of the Institute of Statistical Mathematics, 1970
A standard M/G~1 queueing process will be generalized in this paper under the following three assumptions. First, the assumption due to Welch [12] is postulated. (A. 1) customers who initiate a busy period have a possibly different type of service time distribution function from that of customers who do not initiate a busy period. As is stated in [12],
openaire   +2 more sources