Efficient Computations for the Discrete GI/G/1 System

DOI10.1287/IJOC.1060.0190zbMath1241.90027OpenAlexW2150118366MaRDI QIDQ2892361

Attahiru Sule Alfa, Jungong Xue

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1060.0190

zbMATH Keywords

waiting timetail probabilitiesmatrix-analytic methodsqueue lengthdiscrete \(GI/G/1\) systemsdiscrete \(PH/PH/1\) systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails ⋮ Computational procedures for a class of GI/D/\(k\) systems in discrete time

This page was built for publication: Efficient Computations for the Discrete GI/G/1 System