Waiting time analysis of a two-stage queueing system with priorities

1993 ◽  
Vol 14 (3-4) ◽  
pp. 457-473 ◽  
Author(s):  
Christos Langaris
Keyword(s):  
Waiting Time ◽  
Queueing System ◽  
Time Analysis ◽  
Two Stage

ASYMPTOTIC WAITING TIME ANALYSIS OF A FINITE-SOURCE M/M/1 RETRIAL QUEUEING SYSTEM

2018 ◽  
Vol 33 (3) ◽  
pp. 387-403 ◽  
Author(s):  
E. Sudyko ◽  
A.A. Nazarov ◽  
J. Sztrik
Keyword(s):  
Waiting Time ◽  
Queueing System ◽  
Simulation Software ◽  
Generalized Exponential Distribution ◽  
Time Analysis ◽  
Asymptotic Results ◽  
Retrial Queueing System ◽  
Software Packages ◽  
Finite Source ◽  
Retrial Queueing

The aim of the paper is to derive the distribution of the number of retrial of the tagged request and as a consequence to present the waiting time analysis of a finite-source M/M/1 retrial queueing system by using the method of asymptotic analysis under the condition of the unlimited growing number of sources. As a result of the investigation, it is shown that the asymptotic distribution of the number of retrials of the tagged customer in the orbit is geometric with given parameter, and the waiting time of the tagged customer has a generalized exponential distribution. For the considered retrial queuing system numerical and simulation software packages are also developed. With the help of several sample examples the accuracy and range of applicability of the asymptotic results in prelimit situation are illustrated showing the effectiveness of the proposed approximation.

Waiting Time Analysis at University Hospitals Based on Visitor Psychology

2020 ◽  
pp. 212-221
Author(s):  
Shigeyoshi Iizuka ◽  
Shozo Nishii ◽  
Eriko Tanimoto ◽  
Hiro Nakazawa ◽  
Asuka Kodaka ◽  
...  
Keyword(s):  
Waiting Time ◽  
Time Analysis ◽  
University Hospitals

On the waiting time distribution in a generalized queueing system with uniformly bounded sojourn times

1972 ◽  
Vol 9 (3) ◽  
pp. 642-649 ◽  
Author(s):  
Jacqueline Loris-Teghem
Keyword(s):  
Generating Function ◽  
Waiting Time ◽  
Service Time ◽  
Time Distribution ◽  
Queueing System ◽  
Waiting Time Distribution ◽  
Stieltjes Transform ◽  
Sojourn Times ◽  
Stieltjes Transforms ◽  
Uniformly Bounded

A generalized queueing system with (N + 2) types of triplets (delay, service time, probability of joining the queue) and with uniformly bounded sojourn times is considered. An expression for the generating function of the Laplace-Stieltjes transforms of the waiting time distributions is derived analytically, in a case where some of the random variables defining the model have a rational Laplace-Stieltjes transform.The standard Kl/Km/1 queueing system with uniformly bounded sojourn times is considered in particular.

Patient arrival pattern and waiting time analysis for a tertiary hospital radiology department

2019 ◽  
Vol 25 (3) ◽  
pp. 136-143
Author(s):  
Felicitas Ugochinyere Idigo ◽  
Kenneth Kalu Agwu ◽  
Obinna Emmanuel Onwujekwe ◽  
Mark Chukwudi Okeji ◽  
Angel-Mary Chukwunyelu Anakwue
Keyword(s):  
Waiting Time ◽  
Tertiary Hospital ◽  
Radiology Department ◽  
Time Analysis ◽  
Patient Arrival ◽  
Arrival Pattern

On the comparison of waiting times in tandem queues

1981 ◽  
Vol 18 (03) ◽  
pp. 707-714 ◽  
Author(s):  
Shun-Chen Niu
Keyword(s):  
Waiting Time ◽  
Queueing System ◽  
Waiting Times ◽  
Distribution Functions ◽  
Partial Ordering ◽  
Tandem Queues ◽  
Order Relations ◽  
Service Distribution ◽  
In Series ◽  
Definition Of

Using a definition of partial ordering of distribution functions, it is proven that for a tandem queueing system with many stations in series, where each station can have either one server with an arbitrary service distribution or a number of constant servers in parallel, the expected total waiting time in system of every customer decreases as the interarrival and service distributions becomes smaller with respect to that ordering. Some stronger conclusions are also given under stronger order relations. Using these results, bounds for the expected total waiting time in system are then readily obtained for wide classes of tandem queues.

Sign in / Sign up

Export Citation Format

Share Document