Performance and cost analysis of Geom/G/1 queue with exhaustive service rule and multiple vacations

DOI10.1080/02331934.2013.811663zbMath1328.60204OpenAlexW1965328126MaRDI QIDQ3453416

Yong Hao, Zhanyou Ma, Wuyi Yue, Guanghong Cui

Publication date: 27 November 2015

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2013.811663

zbMATH Keywords

performance analysismultiple vacationsembedded Markov chain\(\mathrm{Geom}^X/\mathrm{G}/1\) queueexhaustive service rule

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis of the M^x/G/1 queue by N-policy and multiple vacations
• A multiple vacation model Mx ¦ G ¦ 1 with balking

This page was built for publication: Performance and cost analysis of Geom/G/1 queue with exhaustive service rule and multiple vacations