Results 281 to 290 of about 29,745 (314)
Some of the next articles are maybe not open access.
Information Processing Letters, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mordecai J. Golin, Robert Sedgewick
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mordecai J. Golin, Robert Sedgewick
openaire +2 more sources
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
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
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
As nurses well know the ultra sound scan is one of the most important technological advances in medicine.
openaire +2 more sources
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
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
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
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
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.
openaire +1 more source
Pooled vs. Dedicated Queues when Customers Are Delay-Sensitive
Management Science, 2021Nur Sunar, Serhan Ziya
exaly