Results 281 to 290 of about 63,418 (315)
Some of the next articles are maybe not open access.

Cascades of queues

Journal of the Operational Research Society, 2006
This paper presents results from a bulk service queueing system, where the main service takes place at fixed time intervals, but where back-up (or relief) services may be introduced in times of heavy demand on the system. On occasions the back-up service itself may receive further back-up services, thus leading to the concept of a cascade of queues ...
openaire   +1 more source

Queue-mergesort

Information Processing Letters, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mordecai J. Golin, Robert Sedgewick
openaire   +2 more sources

Priority Queues

Operations Research, 1964
Customers of different priorities are arriving at a counter in accordance with a Poisson process. The customers are served by a single server in order of priority and for each priority in order of arrival. Two cases are considered: (i) service with privileged interruptions and (ii) service without interruption.
openaire   +1 more source

A Multiprogramming Queue

Journal of the ACM, 1973
Igal Adiri, Micha Hofri, Micha Yadin
openaire   +1 more source

Jumping the queue

Nursing Standard, 1988
As nurses well know the ultra sound scan is one of the most important technological advances in medicine.
openaire   +2 more sources

The Baskets Queue

2008
FIFO Queues have over the years been the subject of significant research. Such queues are used as buffers both in a variety of applications, and in recent years as a key tool in buffering data in high speed communication networks. Overall, the most popular dynamic-memory lock-free FIFO queue algorithm in the literature remains the MS-queue algorithm
Moshe Hoffman, Ori Shalev, Nir Shavit
openaire   +1 more source

On Queue-Length Information when Customers Travel to a Queue

Manufacturing and Service Operations Management, 2021
Refael Hassin, Ricky Roet-Green
exaly  

A Model of Queue Scalping

Management Science, 2021
Luyi Yang   +2 more
exaly  

On Jockeying in Queues

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   +1 more source

Tandem Queues and Queueing Networks

2016
Markov 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.
openaire   +1 more source

Home - About - Disclaimer - Privacy