scholarly journals Transient analysis of a single server queueing system with infinite buffer

Author(s):  
Huixia Huo ◽  
Houbao XU ◽  
Zhuoqian Chen ◽  
Thet Thet Win

As a typical single server queueing system, computer integrated manufacturing system (CIMS) has been widely used in the field of intelligent manufacturing. Howerve, how to derive its instantaneous index is still an imporant issue. This paper investigates the transient behavior of the CIMS with spectral method. By constructing an asymptotic system and analyzing the spectral distribution, we derive the explicit transient solution of the asymptotic system. Trottter-Kato theorem is used to prove that the transient solution of the CIMS is just the limitation of explicit transient solution of the asymptotic system. At the end of the paper, numerical examples are shown to illustrate the effectiveness of the proposed approximation.

1993 ◽  
Vol 6 (4) ◽  
pp. 359-384 ◽  
Author(s):  
David C. R. Muh

The author studies the queueing process in a single-server, bulk arrival and batch service queueing system with a compound Poisson input, bilevel service delay discipline, start-up time, and a fixed accumulation level with control operating policy. It is assumed that when the queue length falls below a predefined level r(≥1), the system, with server capacity R, immediately stops service until the queue length reaches or exceeds the second predefined accumulation level N(≥r). Two cases, with N≤R and N≥R, are studied.The author finds explicitly the probability generating function of the stationary distribution of the queueing process and gives numerical examples.


2020 ◽  
Vol 37 (6) ◽  
pp. 1945-1965 ◽  
Author(s):  
Sherif I. Ammar ◽  
Tao Jiang ◽  
Qingqing Ye

Purpose This paper aims to consider a single server queue with system disasters and impatience behavior are evident in our daily life. For this purpose, authors require to know the general behavior of these systems. Transient analysis shows for us how the system will operate up to some time instant t. Design/methodology/approach In this paper, authors consider a single server queue with system disaster and impatient behavior of customers in a multi-phase random environment, in which the system transits to a repair state after each system disaster. When the system is in a failure phase or going through a repair phase, the new arrivals would be impatient. In case the system is not repaired before the customer’s time expires, the customer would leave the queue and never return. Moreover, after repair, the system becomes ready for service in an operative phase with probability $q_{i} \ge 0.$. Using generating functions along with continued fractions and some properties of the confluent hypergeometric function, authors obtained on their own results. Findings Explicit expressions have been obtained for the time-dependent probabilities of the underlying queuing model. Also, time-dependent mean and variance of customers in the system are deduced. Research limitations/implications The system authors are dealing with is somewhat complicated, there are some performance measures that cannot be achieved, but some of them have been obtained, such as the expectation and variance of the number of customers in the system. Practical implications Based on the obtained results, some numerical examples are some numerical examples are presented to illustrate the effect of various parameters on the behavior of the proposed system. Social implications Authors’ studied transient analysis of a single server queue with system disaster and impatient customer system is suitable for behavior interpretation of many systems in our lives, such as telecommunication networks, inventory systems and impatient telephone switchboard customers, manufacturing system and service system. Originality/value To the best of the author’s/authors’ knowledge and according to the literature survey, in a multi-phase random environment, no previous published article is presented for transient analysis of a single server queue with system disaster and impatient customer behavior in a random environment.


2001 ◽  
Vol 7 (5) ◽  
pp. 433-454 ◽  
Author(s):  
P. R. Parthasarathy ◽  
N. Selvaraju

The transient solution is obtained analytically using continued fractions for a state-dependent birth-death queue in which potential customers are discouraged by the queue length. This queueing system is then compared with the well-known infinite server queueing system which has the same steady state solution as the model under consideration, whereas their transient solutions are different. A natural measure of speed of convergence of the mean number in the system to its stationarity is also computed.


1987 ◽  
Vol 19 (04) ◽  
pp. 997-998 ◽  
Author(s):  
P. R. Parthasarathy

A time-dependent solution for the number in a single-server queueing system with Poisson arrivals and exponential service times is derived in a direct way.


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.


1987 ◽  
Vol 19 (4) ◽  
pp. 997-998 ◽  
Author(s):  
P. R. Parthasarathy

A time-dependent solution for the number in a single-server queueing system with Poisson arrivals and exponential service times is derived in a direct way.


Sign in / Sign up

Export Citation Format

Share Document