Numerical Issues in Computing Steady-State Queueing-Time Distributions of Single-Server Bulk-Service Queues: M/Gb/1 and M/Gd/1
From MaRDI portal
Publication:4030928
DOI10.1287/ijoc.4.3.300zbMath0769.90035OpenAlexW2164222486MaRDI QIDQ4030928
Publication date: 1 April 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.4.3.300
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (7)
The queue GeoX/G/1/N+1 revisited ⋮ A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues ⋮ A Simple and Extended Computational Analysis of M/Gj(a,b)/1 and M/Gj(a,b)/1/(B + b) Queues Using Roots ⋮ Sojourn-time distribution for \(M/G^a/1\) queue with batch service of fixed size -- revisited ⋮ Analysis of a discrete-time queue with modified batch service policy and batch-size-dependent service ⋮ Travel time estimation and order batching in a 2-block warehouse ⋮ Analysis of the sojourn time distribution for \(M/GL/1\) queue with bulk-service of exactly size \(L\)
This page was built for publication: Numerical Issues in Computing Steady-State Queueing-Time Distributions of Single-Server Bulk-Service Queues: M/Gb/1 and M/Gd/1