Analysis of a two-queue model with Bernoulli schedules

1997 ◽  
Vol 34 (1) ◽  
pp. 176-191 ◽  
Author(s):  
Duan-Shin Lee

In this paper we analyze a single server two-queue model with Bernoulli schedules. This discipline is very flexible and contains the exhaustive and 1-limited disciplines as special cases. We formulate the queueing system as a Riemann boundary value problem with shift. The boundary value problem is solved by exploring a Fredholm integral equation around the unit circle. Some numerical examples are presented at the end of the paper.

1997 ◽  
Vol 34 (01) ◽  
pp. 176-191 ◽  
Author(s):  
Duan-Shin Lee

In this paper we analyze a single server two-queue model with Bernoulli schedules. This discipline is very flexible and contains the exhaustive and 1-limited disciplines as special cases. We formulate the queueing system as a Riemann boundary value problem with shift. The boundary value problem is solved by exploring a Fredholm integral equation around the unit circle. Some numerical examples are presented at the end of the paper.


1989 ◽  
Vol 3 (4) ◽  
pp. 517-536
Author(s):  
F. Baccelli ◽  
E.G. Coffman ◽  
E.N. Gilbert

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. This cell holds an item requiring service with probability a, holds a passerby requiring no service with probability b, and is empty with probability (1– a – b). Service times are integers synchronized with the arrival of cells at the input, and they are geometrically distributed with parameter μ. Items requiring service are placed in an unbounded queue to await service. Served items are put in a second unbounded queue to await replacement on the conveyor in cells at the input position. Two models are considered. In one, a served item can only be placed into a cell that was empty on arrival; in the other, the served item can be placed into a cell that was either empty or contained an item requiring service (in the latter case unloading and loading at the input position can take place in the same time unit). The stationary joint distribution of the numbers of items in the two queues is studied for both models. It is verified that, in general, this distribution does not have a product form. Explicit results are worked out for special cases, e.g., when b = 0, and when all service times are one time unit (μ = 1). It is shown how the analysis of the general problem can be reduced to the solution of a Riemann boundary-value problem.


Author(s):  
E. E. Burniston ◽  
C. E. Siewert

AbstractA method of finding explicit expressions for the roots of a certain class of transcendental equations is discussed. In particular it is shown by determining a canonical solution of an associated Riemann boundary-value problem that expressions for the roots may be derived in closed form. The explicit solutions to two transcendental equations, tan β = ωβ and β tan β = ω, are discussed in detail, and additional specific results are given.


Sign in / Sign up

Export Citation Format

Share Document