The shorter queue problem: A numerical study using the matrix-geometric solution
type: Item
instance of: scholarly article
title: The shorter queue problem: A numerical study using the matrix-geometric solution
zbMATH Open document ID: 0546.90036
DOI: 10.1016/0377-2217(84)90106-1
published in: European Journal of Operational Research
publication date: 1984-01-01T00:00:00Z
review text: The paper is devoted to a numerical study of a shorter queue system (SQS) with two queues where customers, on arrival, join the shorter one. As a truncation of SQS, the MSQS problem is considered. MSQS has an additional property: if the difference between the longer and the shorter queue reaches some level n, then one customer leaves the longer queue for the shorter one. For large n MSQS gives an approximation to SQS. The infinitesimal generator of a Markov process describing MSQS under standard assumptions can be presented in the form of a three-diagonal infinite block matrix. To find the stationary probability vector the matrix-geometric approach of \textit{M. F. Neuts} [''Matrix-geometric solutions in stochastic models'' (1981; Zbl 0469.60002)] is used. This approach is a matrix generalization of the well-known way to investigate the scalar three-diagonal case and requires to solve a matrix quadratic equation. One can obtain the desired minimal nonnegative solution of this equation (minimal ''matrix eigenvalue'') by an iteration scheme investigated by Neuts. This paper contains the results of computations of the stationary distributions and average waiting times for the various values of the traffic intensity \(\rho\). It is shown that SQS is slower than the corresponding M/M/2 system. The relative differences in waiting times changes from 0.5 for \(\rho =0.1\) to 0.05 for \(\rho =0.9\).
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 3870999
zbMATH Keywords: matrix-geometric solution technique
zbMATH Keywords: numerical study
zbMATH Keywords: shorter queue system
zbMATH Keywords: two queues
zbMATH Keywords: stationary distributions
zbMATH Keywords: average waiting times
author: Ilya Gertsbakh
MaRDI profile type: Publication
full work available at URL: 0377-2217(84)90106-1
OpenAlex ID: W2087643035
cites work: Two queues in parallel
cites work: Q4070096
cites work: TWO QUEUES IN PARALLEL
cites work: Two Similar Queues in Parallel
cites work: Q3923308
Recommended article: Matrix-geometric solution of a multiserver queue with Markovian group arrivals and Coxian servers
Recommended article: Upper and lower bounds for the waiting time in the symmetric shortest queue system
Recommended article: An M/M/1 queue with a general bulk service rule
Recommended article: Q4516094
Recommended article: Semi-explicit solutions for M/PH/1-like queueing systems
Recommended article: Analyses of an M/M/N queue with servers' vacations
Recommended article: A Queueing System with Auxiliary Servers
Recommended article: Perturbation analysis of a phase-type queue with weakly correlated arrivals
description: scientific article; zbMATH DE number 3870999