Finite buffer single vacation queue with accessible and non-accessible batch service

MaRDI QIDQ2786402zbMATH OpenFDO

Authors O. M. Yesuf, P. Vijaya Laxmi, V. Goswami

Publication date 22 September 2010

Published in International Journal of Information and Management Sciences (Search for Journal in Brave)

Full work available at URL http://ijims.ms.tku.edu.tw/mss/M21/M21N2/o21n22/index.html

zbMATH Keywords

accessible batchfinite bufferMarkov chainqueuesingle vacationsupplementary variable

Mathematics Subject Classification ID

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

Recommendations

• Finite buffer queueing system with accessible and non-accessible batches and single vacation
• A renewal input accessible and non-accessible batch service queue with servers' vacation
• Discrete-time renewal input multiple vacation queue with accessible and non-accessible batches
• Renewal input infinite buffer batch service queue with single exponential working vacation and accessibility to batches
• Analytic and numerical aspects of batch service queues with single vacation

Cited in

(4)

• Renewal input infinite buffer batch service queue with single exponential working vacation and accessibility to batches
• A renewal input accessible and non-accessible batch service queue with servers' vacation
• Finite buffer queueing system with accessible and non-accessible batches and single vacation
• Discrete-time renewal input multiple vacation queue with accessible and non-accessible batches

This page was built for publication: Finite buffer single vacation queue with 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 Q2786402)