Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Control policies for the MX/g/1 queueing system
Management Science
A queue with service interruptions in an alternating random environment
Operations Research
Optimal control of the vacation scheme in a M/G/1 queue
Operations Research
Two queues with alternating service and server breakdown
Queueing Systems: Theory and Applications
Batch arrival queue with N-policy and single vacation
Computers and Operations Research
A single server queue with service interruptions
Queueing Systems: Theory and Applications
The M/G/1 processor-sharing queue with disasters
Computers & Mathematics with Applications
A two-stage batch arrival queueing system with a modified bernoulli schedule vacation under N-policy
Mathematical and Computer Modelling: An International Journal
Modified T vacation policy for an M/G/1 queueing system with an unreliable server and startup
Mathematical and Computer Modelling: An International Journal
A single server priority queue with server failures and queue flushing
Operations Research Letters
A queueing network model with catastrophes and product form solution
Operations Research Letters
Computational analysis of machine repair problem with unreliable multi-repairmen
Computers and Operations Research
Analysis of an infinite multi-server queue with an optional service
Computers and Industrial Engineering
Computers and Industrial Engineering
| Hi-index | 0.98 |
This paper deals with an M^X/G/1 Bernoulli vacation queue with two phases of service and unreliable server under N-policy. While the server is working with any phase of service, it may break down at any instant and the service channel becomes unavailable. The breakdown period is followed by a delay period. If no customer arrives when the server is unavailable, the server becomes idle in the system until the queue size builds up to a threshold value N(=1). As soon as the queue size becomes at least N, the server immediately begins to serve the waiting customers in two successive phases of service. The first phase of service is followed by a second phase, after the completion of which, the server may take a vacation or may remain in the system to serve the next unit, if any. We derive the queue size distribution at a random epoch and at a departure epoch, as well as various system performance measures. Finally, we derive a simple procedure to obtain the optimal stationary policy under a linear cost structure.