Results 141 to 150 of about 278,053 (189)

On the order of tandem queues

Queueing Systems, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dinah W. Cheng, Rhonda Righter
openaire   +3 more sources

Tandem Conveyor Queues

Probability in the Engineering and Informational Sciences, 1989
This paper analyzes a queueing system in which a constant-speed conveyor brings new items for service and carries away served items. The conveyor is a sequence of cells each able to hold at most one item. At each integer time, a new cell appears at the queue's input position.
Baccelli, F., Coffman, E. G. jun., Gilbert, E. N.   +2 more
openaire   +2 more sources

A Tandem Queue with a Gate Mechanism

Queueing Systems, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zbigniew Palmowski, Sabine Schlegel, Onno J. Boxma   +2 more
openaire   +4 more sources

Work-Conserving Tandem Queues

Queueing Systems, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chia-Li Wang, Ronald W. Wolff
openaire   +2 more sources

Tandem Queues with Planned Inventories

Operations Research, 1992
This paper explores a natural generalization of the classic tandem-queue model, designed specifically to represent make- to-stock production processes. In such systems, intermediate and finished goods can be produced and stored in advance of demand.
Yong-Joo Lee, Paul H. Zipkin
openaire   +3 more sources

CONVEXITY IN TANDEM QUEUES

Probability in the Engineering and Informational Sciences, 2004
We derive convexity results and related properties for the value functions of tandem queuing systems. The results for standard multiserver queues are new. For completeness, we also prove and generalize existing results on tandems of controllable queues. The results can be used to compare queuing systems.
openaire   +3 more sources

On the Shortest Queue Policy for the Tandem Parallel Queue

Probability in the Engineering and Informational Sciences, 1992
We consider two nodes in tandem. At each node or service center, there are two exponential servers present with the same service rate μ and each with its own queue. Customers arrive at the first node according to a Poisson process with arrival rate λ.
Hordijk, Arie, Koole, Ger
openaire   +2 more sources

Age of Information for Queues in Tandem

MILCOM 2018 - 2018 IEEE Military Communications Conference (MILCOM), 2018
As a stepping stone towards understanding the freshness of information in multi-hop networks, we study the age of information metric for queues in tandem. Applying the recent stochastic hybrid systems approach for age of information, we derive the average age for two non-preemptive first-come, first-served queues in tandem with memoryless arrival and ...
Clement Kam, Joseph P. Molnar, Sastry Kompella   +2 more
openaire   +2 more sources

Tandem queues with impatient customers

Performance Evaluation, 2019
Abstract This paper studies a Markovian two-station tandem queueing network with impatient customers. Queueing networks with abandonment are common in many industries, e.g., call centers and healthcare. Therefore, their management has received much attention. The resulting model is a level-dependent quasi-birth-and-death (LDQBD) process.
Jianfu Wang, Hossein Abouee-Mehrizi, Opher Baron, Oded Berman   +3 more
openaire   +1 more source

An Approximation Method for Tandem Queues with Blocking

Operations Research, 1988
We propose an approximate analysis of open systems of tandem queues with blocking caused by finite buffers between servers. Our approach relies on the use of marginal probability distributions (“state equivalence”) coupled with an approximate evaluation of the conditional probabilities introduced through the equivalence.
Alexandre Brandwajn, Yung-Li Lily Jow
openaire   +2 more sources