Results 231 to 240 of about 25,343 (268)
Some of the next articles are maybe not open access.
ACM SIGMETRICS Performance Evaluation Review, 2012
We consider a pricing in a single observable queue, where customers all have the same valuation, V , and the same waiting cost, v. It is known that earning rate is maximized in such a model when state-dependent pricing is used and an admissions threshold is deployed whereby arriving customers may not join the queue if the total number of customers ...
Christian Borgs +4 more
openaire +1 more source
We consider a pricing in a single observable queue, where customers all have the same valuation, V , and the same waiting cost, v. It is known that earning rate is maximized in such a model when state-dependent pricing is used and an admissions threshold is deployed whereby arriving customers may not join the queue if the total number of customers ...
Christian Borgs +4 more
openaire +1 more source
International Joint Conference on Autonomous Agents and Multiagent Systems, 2015
Burstiness in queues where customers arrive independently leads to rush periods when wait times are long. We propose a simple signaling scheme to decrease wait times by distributing customer arrivals more uniformly. Agents receive one of several signals with suggestions on what time to join the queue. We quantify the efficiency gains, both analytically
Laura Brink, Robert Shorten, Jia Yuan Yu
openaire +2 more sources
Burstiness in queues where customers arrive independently leads to rush periods when wait times are long. We propose a simple signaling scheme to decrease wait times by distributing customer arrivals more uniformly. Agents receive one of several signals with suggestions on what time to join the queue. We quantify the efficiency gains, both analytically
Laura Brink, Robert Shorten, Jia Yuan Yu
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
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
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
On Queue-Length Information when Customers Travel to a Queue
Manufacturing and Service Operations Management, 2021Ricky Roet-Green, Refael Hassin
exaly
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