Analysis of a finite buffer general input queue with Markovian service process and accessible and non-accessible batch service

DOI10.3934/JIMO.2010.6.929MaRDI QIDQ620029zbMATH OpenOpenAlexFDO

Authors O. M. Yesuf, P. Vijaya Laxmi

Publication date 19 January 2011

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2010.6.929

zbMATH Keywords

accessible batchbatch serviceMarkovian service processqueuesupplementary variable

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Recommendations

• Finite-Buffer Bulk Service Queue Under Markovian Service Process:GI/MSP^(a,b)/1/N
• Analyzing the finite buffer batch arrival queue under Markovian service process: \(\mathrm{GI}^X /\mathrm{MSP}/1/\mathrm{N}\)
• Discrete-time batch service \(GI/Geo/1/N\) queue with accessible and non-accessible batches
• On the finite buffer queue with renewal input and batch Markovian service process: \(\mathrm{GI}/\mathrm{BMSP}/1/N\)
• Analysis of a finite-buffer bulk-service queue under Markovian arrival process with batch-size-dependent service

Cited in

(2)

• Analyzing the finite buffer batch arrival queue under Markovian service process: \(\mathrm{GI}^X /\mathrm{MSP}/1/\mathrm{N}\)
• Finite-Buffer Bulk Service Queue Under Markovian Service Process:GI/MSP^(a,b)/1/N

This page was built for publication: Analysis of a finite buffer general input queue with Markovian service process and accessible and non-accessible batch service

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620029)