scholarly journals A Relation between Queue-Length Distributions during Server Vacations in Queues with Batch Arrivals, Batch Services, or Multiclass Arrivals: An Extension of Burke's Theorem

2015 ◽  
Vol 8 (25) ◽  
Author(s):  
Kilhwan Kim
2000 ◽  
Vol 32 (01) ◽  
pp. 284-313 ◽  
Author(s):  
Xiuli Chao ◽  
Masakiyo Miyazawa

In this paper we extend the notion of quasi-reversibility and apply it to the study of queueing networks with instantaneous movements and signals. The signals treated here are considerably more general than those in the existing literature. The approach not only provides a unified view for queueing networks with tractable stationary distributions, it also enables us to find several new classes of product form queueing networks, including networks with positive and negative signals that instantly add or remove customers from a sequence of nodes, networks with batch arrivals, batch services and assembly-transfer features, and models with concurrent batch additions and batch deletions along a fixed or a random route of the network.


1995 ◽  
Vol 20 (3-4) ◽  
pp. 341-368 ◽  
Author(s):  
Christos Langaris ◽  
Evangelos Moutzoukis

2019 ◽  
Vol 2019 ◽  
pp. 1-13
Author(s):  
Hui Ren ◽  
Dongyu Wang

The conveyor assembly line has been widely used in manufacturing industries to produce standard products with low costs. However, due to lack of flexibility, this production method has not been conducive to multivariety and small-batch production. In this situation, seru production formed by converting conveyor assembly lines has been a successful innovation in the Japanese manufacturing industry. Most of the existing literature has studied the benefits of this line-seru conversion from the perspective of the enterprises themselves, but this paper studies the effect of the line-seru conversion on the waiting time from the perspective of the customer. First, the change in the average waiting queue length caused by the line-seru conversion is proposed as an evaluation index. Second, with the consideration of the practical situation of random batch arrivals, the average waiting queue length formulas for the conveyor assembly line and seru production are established based on the assumption that the arrival is a Poisson process. Then, under two scenarios, we investigate the relationship between the average waiting queue length changed by the line-seru conversion and other parameters and find that the conversion can reduce the average waiting queue length in multivariety and small-batch production. Finally, under other potential scenarios, the equations for determining the average waiting queue length resulting from a change to line-seru conversion are derived.


1993 ◽  
Vol 25 (01) ◽  
pp. 235-254 ◽  
Author(s):  
Josep M. Ferrandiz

Using Palm-martingale calculus, we derive the workload characteristic function and queue length moment generating function for the BMAP/GI/1 queue with server vacations. In the queueing system under study, the server may start a vacation at the completion of a service or at the arrival of a customer finding an empty system. In the latter case we will talk of a server set-up time. The distribution of a set-up time or of a vacation period after a departure leaving a non-empty system behind is conditionally independent of the queue length and workload. Furthermore, the distribution of the server set-up times may be different from the distribution of vacations at service completion times. The results are particularized to the M/GI/1 queue and to the BMAP/GI/1 queue (without vacations).


1991 ◽  
Vol 28 (02) ◽  
pp. 409-421 ◽  
Author(s):  
W. Henderson ◽  
P. G. Taylor

Product-form equilibrium distributions in networks of queues in which customers move singly have been known since 1957, when Jackson derived some surprising independence results. A product-form equilibrium distribution has also recently been shown to be valid for certain queueing networks with batch arrivals, batch services and even correlated routing. This paper derives the joint equilibrium distribution of states immediately before and after a batch of customers is released into the network. The results are valid for either discrete- or continuous-time queueing networks: previously obtained results can be seen as marginal distributions within a more general framework. A generalisation of the classical ‘arrival theorem' for continuous-time networks is given, which compares the equilibrium distribution as seen by arrivals to the time-averaged equilibrium distribution.


2020 ◽  
Vol 52 (1) ◽  
pp. 32-60
Author(s):  
Roland De Haan ◽  
Ahmad Al Hanbali ◽  
Richard J. Boucherie ◽  
Jan-Kees Van Ommeren

AbstractPolling systems are queueing systems consisting of multiple queues served by a single server. In this paper we analyze two types of preemptive time-limited polling systems, the so-called pure and exhaustive time-limited disciplines. In particular, we derive a direct relation for the evolution of the joint queue length during the course of a server visit. The analysis of the pure time-limited discipline builds on and extends several known results for the transient analysis of an M/G/1 queue. For the analysis of the exhaustive discipline we derive several new results for the transient analysis of the M/G/1 queue during a busy period. The final expressions for both types of polling systems that we obtain generalize previous results by incorporating customer routeing, generalized service times, batch arrivals, and Markovian polling of the server.


2000 ◽  
Vol 32 (1) ◽  
pp. 284-313 ◽  
Author(s):  
Xiuli Chao ◽  
Masakiyo Miyazawa

In this paper we extend the notion of quasi-reversibility and apply it to the study of queueing networks with instantaneous movements and signals. The signals treated here are considerably more general than those in the existing literature. The approach not only provides a unified view for queueing networks with tractable stationary distributions, it also enables us to find several new classes of product form queueing networks, including networks with positive and negative signals that instantly add or remove customers from a sequence of nodes, networks with batch arrivals, batch services and assembly-transfer features, and models with concurrent batch additions and batch deletions along a fixed or a random route of the network.


Sign in / Sign up

Export Citation Format

Share Document