The (n,N) policy of the M^X/G/1/K queue with multiple removable server

MaRDI QIDQ3453467zbMATH OpenFDO

Authors Rekha Sharma, Manju Sharma

Publication date 27 November 2015

zbMATH Keywords

\(M^X/G/1/K\) queuemultiple removable serveroptimal policyqueue length

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• Optimal control of the \(M^ X/G/1/K\) queue with multiple server vacations
• Analysis of the M^x/G/1 queue by N-policy and multiple vacations
• Cost optimization of a repairable M/G/1 queue with a randomized policy and single vacation
• Optimal control of a removable server in an M/G/1 queue with finite capacity
• Optimal control of an M/H_k/1 queueing system with a removable server

Cited in

(3)

• Optimal strategy analysis of an \(N\)-policy \(M[x]/M/1\) queueing system with a removable and non-reliable server
• A simple policy for multiple queues with size-independent service times
• Comparative analysis for the N policy M/G/1 queueing system with a removable and unreliable server

This page was built for publication: The \((n,N)\) policy of the \(M^X/G/1/K\) queue with multiple removable server

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