Results 191 to 200 of about 33,611 (226)
Some of the next articles are maybe not open access.
Light traffic approximations in many-server queues
Advances in Applied Probability, 1992This paper complements two previous studies (Daley and Rolski (1984), (1991)) by investigating limit properties of the waiting time ink-server queues with renewal arrival process under ‘light traffic' conditions. Formulae for the limits of the probability of waiting and the waiting time moments are derived for the two approaches of dilation and ...
Daley, D. J., Rolski, T.
openaire +1 more source
Transient Properties of Many-Server Queues and Related QBDs
Queueing Systems, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asmussen, S., Pihlsgård, M.
openaire +2 more sources
A correlated queue with infinitely many servers
Journal of Applied Probability, 1986This work analyses a queueing mechanism with infinitely many servers in which the interarrival interval T preceding the arrival of a customer and his service time S are assumed correlated. A bivariate distribution with negative exponential marginals is used and the Laplace transforms pn (z) of the system probabilities in transient state
openaire +1 more source
A Many Server Queueing Problem with Variable Departures
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1969AbstractThe present paper studies the behaviour of a queueing system in which arrivals form a Poisson distribution and departures occur in batches of variable size. Service is accomplished in M parallel channels and each channel has the same fixed capacity of serving at the most K units. Service is ordered and instantaneous.
openaire +2 more sources
Some general results for many server queues
Advances in Applied Probability, 1973Pollaczek's theory for the many server queue is generalized and extended. Pollaczek (1961) found the distribution of the actual waiting times in the model G/G/s as a solution of a set of integral equations. We give a somewhat more general set of integral equations from which the joint distribution of the actual waiting time and some other random ...
openaire +2 more sources
Spatial Queues with Infinitely Many Servers
2003Spatial Queues with infinitely many servers arise naturally as models for the planning process of mobile communication networks. A very useful concept has been developed by Cinlar [44], partly on the basis of Massey and Whitt [84]. This assumes single arrivals distributed in time as a non-homogeneous Poisson process. Every arrival chooses a position in
openaire +1 more source
Virtual allocation policies for many-server queues with abandonment
Mathematical Methods of Operations Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhenghua Long, Jiheng Zhang
openaire +3 more sources
Simplified Control Problems for Multiclass Many-Server Queueing Systems
Mathematics of Operations Research, 2009We consider scheduling and routing control problems for queueing models with I customer classes and J server pools, each consisting of many statistically identical, exponential servers. Customers require a single service that can be performed by a server from one of the pools; the service rate is μij ≥ 0, which depends on the customer's class i and ...
Rami Atar +2 more
openaire +1 more source
Time-Dependent Solution of the Many-Server Poisson Queue
Operations Research, 1960In this paper we obtain the Laplace transform of the transient probabilities of the ordered queuing problem, with Poisson inputs, multiple channels, and exponential service times. Explicit expressions are derived for the two-channel case and known equilibrium conditions are shown to hold. The proof proceeds in two stages. The first obtains the Laplace
openaire +1 more source
Fluid models for many-server Markovian queues in a changing environment
Operations Research Letters, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, B., Zwart, A.P.
openaire +2 more sources