A non markovian retrial queueing system

This paper studies a discrete-time queueing system in which a customer who enters in the system with a server occupied may choose to go to the retrial group or to begin its service displacing to the retrial group the customer that was in the server. If the server is idle the arriving customer begins...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational and applied mathematics 2023-10, Vol.431, p.115277, Article 115277
Main Authors: Atencia, Ivan, Galán-García, María Ángeles, Aguilera-Venegas, Gabriel, Galán-García, José Luis
Format: Article
Language:English
Subjects:
Busy period
Retrial queue
Sojourn times
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies a discrete-time queueing system in which a customer who enters in the system with a server occupied may choose to go to the retrial group or to begin its service displacing to the retrial group the customer that was in the server. If the server is idle the arriving customer begins its service immediately. Retrial and service times are general, and the only repeated customer that can go directly to the server is the one situated at the first place of the retrial group. A complete study of the model has been curried out noting specially the analysis of a recursive algorithm implemented by Theorems 2 and 3 and the study of the waiting time of a customer in the queue and in the system. Finally numerical examples are given.
ISSN:0377-0427
1879-1778
DOI:10.1016/j.cam.2023.115277