scholarly journals The Multiphase Queuing System of the Rijeka Airport

Pomorstvo ◽  
2019 ◽  
Vol 33 (2) ◽  
pp. 205-209
Author(s):  
Svjetlana Hess ◽  
Ana Grbčić
Keyword(s):  
Performance Indicators ◽  
Queueing Theory ◽  
Rare Case ◽  
Queueing System ◽  
Service System ◽  
Waiting Times ◽  
Real Problem ◽  
Single Server ◽  
Scientific Contribution ◽  
The Real

The paper gives an overview of the real system as a multiphase single server queuing problem, which is a rare case in papers dealing with the application of the queueing theory. The methodological and scientific contribution of this paper is primarily in setting up the model of the real problem applying the multiphase queueing theory. The research of service system at Rijeka Airport may allow the airport to be more competitive by increasing service quality. The existing performance measures have been evaluated in order to improve Rijeka Airport queueing system, as a record number of passengers is to be expected in the next few years. Performance indicators have pointed out how the system handles congestion. The research is also focused on defining potential bottlenecks and comparing the results with IATA guidelines in terms of maximum waiting times.

The total waiting time in a busy period of a stable single-server queue, I.

1969 ◽  
Vol 6 (03) ◽  
pp. 550-564 ◽  
Author(s):  
D. J. Daley
Keyword(s):  
Waiting Time ◽  
Queueing Theory ◽  
Busy Period ◽  
Queueing System ◽  
Road Traffic ◽  
Waiting Times ◽  
Random Variable ◽  
Single Server ◽  
Single Server Queue ◽  
Server Queue

A quantity of particular interest in the study of (road) traffic jams is the total waiting time X of all vehicles involved in a given hold-up (Gaver (1969): see note following (2.3) below and the first paragraph of Section 5). With certain assumptions on the process this random variable X is the same as the sum of waiting times of customers in a busy period of a GI/G/1 queueing system, and it is the object of this paper and its sequel to study the random variable in the queueing theory context.

The total waiting time in a busy period of a stable single-server queue, I.

1969 ◽  
Vol 6 (3) ◽  
pp. 550-564 ◽  
Author(s):  
D. J. Daley
Keyword(s):  
Waiting Time ◽  
Queueing Theory ◽  
Busy Period ◽  
Queueing System ◽  
Road Traffic ◽  
Waiting Times ◽  
Random Variable ◽  
Single Server ◽  
Single Server Queue ◽  
Server Queue

A quantity of particular interest in the study of (road) traffic jams is the total waiting time X of all vehicles involved in a given hold-up (Gaver (1969): see note following (2.3) below and the first paragraph of Section 5). With certain assumptions on the process this random variable X is the same as the sum of waiting times of customers in a busy period of a GI/G/1 queueing system, and it is the object of this paper and its sequel to study the random variable in the queueing theory context.

An Uncertain Single-Server Queueing Model

2021 ◽  
pp. 2150001
Author(s):  
Kai Yao
Keyword(s):  
Queueing Theory ◽  
Busy Period ◽  
Queueing System ◽  
Single Server ◽  
Queueing Model ◽  
Uncertainty Distribution ◽  
Uncertain Variables ◽  
Service Efficiency ◽  
Service Times ◽  
Interarrival Times

In the queueing theory, the interarrival times between customers and the service times for customers are usually regarded as random variables. This paper considers human uncertainty in a queueing system, and proposes an uncertain queueing model in which the interarrival times and the service times are regarded as uncertain variables. The busyness index is derived analytically which indicates the service efficiency of a queueing system. Besides, the uncertainty distribution of the busy period is obtained.

scholarly journals A Priority Queue with Many Customer Types, Correlated Arrivals and Changing Priorities

Mathematics ◽  
2020 ◽  
Vol 8 (8) ◽  
pp. 1292
Author(s):  
Seokjun Lee ◽  
Sergei Dudin ◽  
Olga Dudina ◽  
Chesoong Kim ◽  
Valentina Klimenok
Keyword(s):  
Markov Chain ◽  
Waiting Time ◽  
Performance Indicators ◽  
Queueing System ◽  
Priority Queue ◽  
First Aid ◽  
Single Server ◽  
Finite Buffer ◽  
Impatient Customers ◽  
Arrival Times

A single-server queueing system with a finite buffer, several types of impatient customers, and non-preemptive priorities is analyzed. The initial priority of a customer can increase during its waiting time in the queue. The behavior of the system is described by a multi-dimensional Markov chain. The generator of this chain, having essential dependencies between the components, is derived and formulas for computation of the most important performance indicators of the system are presented. The dependence of some of these indicators on the capacity of the buffer space is illustrated. The profound effect of the phenomenon of correlation of successive inter-arrival times and variance of the service time is numerically demonstrated. Results can be used for the optimization of dispatching various types of customers in information transmission systems, emergency departments and first aid stations, perishable foods supply chains, etc.

A solvable model for a finite-capacity queueing system

1985 ◽  
Vol 22 (4) ◽  
pp. 903-911 ◽  
Author(s):  
V. Giorno ◽  
C. Negri ◽  
A. G. Nobile
Keyword(s):  
Queueing System ◽  
Waiting Times ◽  
Queueing Systems ◽  
Solvable Model ◽  
Probability Density Functions ◽  
Single Server ◽  
Finite Capacity ◽  
System Service ◽  
Transient Probabilities ◽  
Number Of Customers

Single–server–single-queue–FIFO-discipline queueing systems are considered in which at most a finite number of customers N can be present in the system. Service and arrival rates are taken to be dependent upon that state of the system. Interarrival intervals, service intervals, waiting times and busy periods are studied, and the results obtained are used to investigate the features of a special queueing model characterized by parameters (λ (Ν –n), μn). This model retains the qualitative features of the C-model proposed by Conolly [2] and Chan and Conolly [1]. However, quite unlike the latter, it also leads to closed-form expressions for the transient probabilities, the interarrival and service probability density functions and their moments, as well as the effective interarrival and service densities and their moments. Finally, some computational results are given to compare the model discussed in this paper with the C-model.

The suprema of the actual and virtual waiting times during a busy cycle of the K m/K n/1 queueing system

1972 ◽  
Vol 4 (02) ◽  
pp. 339-356
Author(s):  
J. W. Cohen
Keyword(s):  
Limit Theorems ◽  
Queueing System ◽  
Waiting Times ◽  
Analytic Description ◽  
Single Server ◽  
Arrival Times ◽  
Asymptotic Expressions ◽  
Virtual Waiting Time ◽  
Stieltjes Transforms ◽  
Busy Cycle

For the single server queueing system, whose distributions of service and inter-arrival times have rational Laplace-Stieltjes transforms, limit theorems are derived for the supremum of the virtual waiting time during k successive busy cycles for k→∞. Similarly, for the supremum of the actual waiting times of all customers arriving in k successive busy cycles. Only the cases with the load of the system less than one and equal to one are considered. The limit distributions are extreme value distributions. The results are obtained by first deriving a number of asymptotic expressions for the quantities which govern the analytic description of the system K m /K n /1. Using these asymptotic relations limit theorems for entrance times can also be obtained, a few examples are given.

A solvable model for a finite-capacity queueing system

1985 ◽  
Vol 22 (04) ◽  
pp. 903-911 ◽  
Author(s):  
V. Giorno ◽  
C. Negri ◽  
A. G. Nobile
Keyword(s):  
Queueing System ◽  
Waiting Times ◽  
Queueing Systems ◽  
Solvable Model ◽  
Probability Density Functions ◽  
Single Server ◽  
Finite Capacity ◽  
System Service ◽  
Transient Probabilities ◽  
Number Of Customers

Single–server–single-queue–FIFO-discipline queueing systems are considered in which at most a finite number of customers N can be present in the system. Service and arrival rates are taken to be dependent upon that state of the system. Interarrival intervals, service intervals, waiting times and busy periods are studied, and the results obtained are used to investigate the features of a special queueing model characterized by parameters (λ (Ν –n), μn). This model retains the qualitative features of the C-model proposed by Conolly [2] and Chan and Conolly [1]. However, quite unlike the latter, it also leads to closed-form expressions for the transient probabilities, the interarrival and service probability density functions and their moments, as well as the effective interarrival and service densities and their moments. Finally, some computational results are given to compare the model discussed in this paper with the C-model.

The suprema of the actual and virtual waiting times during a busy cycle of the Km/Kn/1 queueing system

1972 ◽  
Vol 4 (2) ◽  
pp. 339-356 ◽  
Author(s):  
J. W. Cohen
Keyword(s):  
Limit Theorems ◽  
Queueing System ◽  
Waiting Times ◽  
Analytic Description ◽  
Single Server ◽  
Arrival Times ◽  
Asymptotic Expressions ◽  
Virtual Waiting Time ◽  
Stieltjes Transforms ◽  
Busy Cycle

For the single server queueing system, whose distributions of service and inter-arrival times have rational Laplace-Stieltjes transforms, limit theorems are derived for the supremum of the virtual waiting time during k successive busy cycles for k→∞. Similarly, for the supremum of the actual waiting times of all customers arriving in k successive busy cycles. Only the cases with the load of the system less than one and equal to one are considered. The limit distributions are extreme value distributions. The results are obtained by first deriving a number of asymptotic expressions for the quantities which govern the analytic description of the system Km/Kn/1. Using these asymptotic relations limit theorems for entrance times can also be obtained, a few examples are given.

scholarly journals A result in queueing theory

1978 ◽  
Vol 19 (1) ◽  
pp. 125-129
Author(s):  
A. Ghosal
Keyword(s):  
Waiting Time ◽  
Queueing Theory ◽  
Waiting Times ◽  
Queueing Systems ◽  
Random Variable ◽  
Equilibrium Distribution Function ◽  
Single Server ◽  
Queue Discipline ◽  
The Difference ◽  
Practical Implications

In a single-server queueing system, subject to the queue discipline ‘First come first served’, the equilibrium distribution function of the waiting time of a server depends on the distribution of the random variable (u) which is the difference between the service time and the inter-arrival time. If in two queueing systems u's are equivalent in distribution, the waiting times are also equivalent in distribution (known result). It has been shown in this note that equivalence in waiting time distributions does not necessarily imply equivalence in distributions of u's. The proof is heuristic. This result has useful practical implications.

Sign in / Sign up

Export Citation Format

Share Document