Optimal strategy analysis of an \(N\)-policy \(M[x]/M/1\) queueing system with a removable and non-reliable server

DOI10.1007/BF03398806zbMath1171.60385OpenAlexW2771550656MaRDI QIDQ1022892

S. Swaroopa Rani, M. I. Afthab Begum, S. Anantha Lakshmi

Publication date: 23 June 2009

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398806

zbMATH Keywords

optimal strategy\(N\)-policycost modelbreakdownstartup time\(N\)-policy \(M[x/M/l\) queueing system]removable and non-reliable server

Mathematics Subject Classification ID

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

Related Items (1)

Optimal strategy analysis of an \(N\)-policy two-phase \(M^X/M/1\) queueing system with server startup and breakdowns

Cites Work

• A Poisson input queue under \(N\)-policy and with a general start up time
• Batch arrival queue with \(N\)-policy and single vacation
• Optimal control of a removable and non-reliable server in an \(M/M/1\) queueing system with exponential startup time
• Optimal strategy policy in batch arrival queue with server breakdowns and multiple vacations
• A recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacity
• A batch arrival queue with a vacation time under single vacation policy
• Optimal Operating Policies for M/G/1 Queuing Systems
• A Note On Operating Policies For The Queue M/M/1 With Exponential Startups

This page was built for publication: Optimal strategy analysis of an \(N\)-policy \(M[x]/M/1\) queueing system with a removable and non-reliable server