Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time

DOI10.1016/j.ejor.2015.01.056zbMath1347.90026OpenAlexW2028399096MaRDI QIDQ319322

Attahiru Sule Alfa, Miao-Miao Yu

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.01.056

zbMATH Keywords

queueingphase-type distributionMarkovian arrival processbatch-size-dependent servicefinite-buffer

Mathematics Subject Classification ID

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

Related Items (11)

An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue ⋮ Stationary queue and server content distribution of a batch-size-dependent service queue with batch Markovian arrival process: BMAP/Gn(a,b)/1 ⋮ Computational analysis of \(GI^{[X}/D-MSP^{(a,b)}/1\) queueing system via \textit{RG}-factorization] ⋮ The setting and optimization of quick queue with customer loss ⋮ Stationary joint distribution of a discrete-time group-arrival and batch-size-dependent service queue with single and multiple vacation ⋮ Analyzing discrete-time \(GI^{[X}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization] ⋮ Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process ⋮ Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline ⋮ Taylor-series approximations for queues with arrival correlation ⋮ A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method:GI/C-MSP^(a,b)/1/∞ ⋮ Analysis of a queueing model with batch Markovian arrival process and general distribution for group clearance

Cites Work

• Unnamed Item
• Unnamed Item
• On the finite buffer queue with renewal input and batch Markovian service process: \(\mathrm{GI}/\mathrm{BMSP}/1/N\)
• Analysis of the discrete-time bulk-service queue Geo/G\(^Y\)/1/N+B.
• Analytic and numerical aspects of batch service queues with single vacation
• Analyzing discrete-time \(\text{D}\)-\(\text{BMAP}/G/1/N\) queue with single and multiple vacations
• The discrete-time \(MAP/PH/1\) queue with multiple working vacations
• A queueing model for general group screening policies and dynamic item arrivals
• Performance analysis of finite buffer discrete-time queue with bulk service
• Performance analysis of a finite-buffer discrete-time queue with bulk arrival, bulk service and vacations
• Markov chain representations of discrete distributions applied to queueing models
• On the finite-buffer bulk-service queue with general independent arrivals: \(GI/M^{[b}/1/N\)]
• Analysis of a finite MAP/\(G\)/1 queue with group services
• Applications of bulk queues to group testing models with incomplete identification
• Discrete-time \(Geo^X /G^{(a,b)}/1/N\) queues with single and multiple vacations
• Matrix?geometric analysis of the discrete time Gi/G/1 system
• Two Types ofRG-Factorizations of Quasi-birth-and-death Processes and Their Applications to Stochastic Integral Functionals
• Constructive Computation in Stochastic Models with Applications
• An M/M/1 queue with a general bulk service rule
• Analysis of a finite-buffer bulk-service queue with discrete-Markovian arrival process: D-MAP/Ga,b/1/N
• A General Class of Bulk Queues with Poisson Input
• Analysis of the MAP/G\(^{a,b}\)/1/N queue
• A Simple and Extended Computational Analysis of M/G_j^(a,b)/1 and M/G_j^(a,b)/1/(B + b) Queues Using Roots

This page was built for publication: Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time