Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue

DOI10.1287/opre.37.1.141zbMath0674.90037OpenAlexW2167006582MaRDI QIDQ3829331

Publication date: 1989

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.37.1.141

zbMATH Keywords

Wiener-Hopf factorization arithmetic GI/G/1 queue waiting time and idle time distributions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (18)

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 ⋮ Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K/SM[K]/1/FCFS Queue] ⋮ Some Results for the Actual Waiting Time in Batch Arrival Queueing Systems ⋮ An analytical solution for the discrete time single server system with semi-Markovian arrivals ⋮ Performance analysis of the \(DAR(1)/D/c\) priority queue under partial buffer sharing policy ⋮ Numerical solution for the departure process from the GI/G/1 queue ⋮ Value of capacity pooling in supply chains with heterogeneous customers ⋮ New approach for finding basic performance measures of single server queue ⋮ An analytical method for the calculation of the number of units at the arrival instant in a discrete time G/G/1-queueing system with batch arrivals ⋮ Non-skip-free M/G/1-type Markov chains and Laurent matrix power series ⋮ Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\) ⋮ A general model for batch building processes under the timeout and capacity rules ⋮ Fluctuation identities with continuous monitoring and their application to the pricing of barrier options ⋮ Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique ⋮ An analytical method for the calculation of the waiting time distribution of a discrete time G/G/1-queueing system with batch arrivals ⋮ Point and interval estimation of decomposition error in discrete-time open tandem queues ⋮ Age process, workload process, sojourn times, and waiting times in a discrete time SM[K/PH[K]/1/FCFS queue] ⋮ Discrete time queues and matrix-analytic methods. (With comments and rejoinder)

This page was built for publication: Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue