The Israeli queue with a general group-joining policy
type: Item
instance of: scholarly article
title: The Israeli queue with a general group-joining policy
zbMATH Open document ID: 1504.60183
author: Nir Perel
author: Uri Yechiali
published in: Annals of Operations Research
publication date: 2022-11-09T00:00:00Z
review text: The study of the paper under review is devoted to a variant of a so-called `Israeli queue' that has been originally introduced in [\textit{O. Boxma} et al., Stoch. Models 24, No. 4, 604--625 (2008; Zbl 1158.60040)]. The Israeli queue is a multi-queueing system, in which the server first visits the queue with the ``oldest'' customer. The authors consider a single-server multi-queue system with unlimited-size batch service, where the next queue to be served is the one with the most senior customer (the aforementioned `Israeli queue'). The described system is a Markovian system with state-dependent group-joining policy, for which the authors derive results for various performance measures, such as steady-state distribution of the number of groups in the system, sojourn times, group sizes, and lengths of busy periods. Closed-form expressions are obtained for both the uniform and geometric joining policies. Numerical results are presented.
reviewed by: Vyacheslav Abramov
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 7614214
zbMATH Keywords: queueing
zbMATH Keywords: unlimited-size batch service
zbMATH Keywords: Israeli queue
zbMATH Keywords: sojourn times
zbMATH Keywords: group sizes
zbMATH Keywords: busy periods
MaRDI profile type: Publication
full work available at URL: s10479-015-1942-1
OpenAlex ID: W950133636
cites work: Polling with Batch Service
cites work: Explicit formula for the inverse of a tridiagonal matrix by backward continued fractions
cites work: The inverse of a tridiagonal matrix
cites work: The Israeli Queue with Priorities
cites work: THE ISRAELI QUEUE WITH INFINITE NUMBER OF GROUPS
cites work: The Israeli queue with retrials
cites work: Q4224236
cites work: Dynamic visit-order rules for batch-service polling
cites work: Q4331901
DOI: 10.1007/S10479-015-1942-1
description: scientific article; zbMATH DE number 7614214