Note on a binomial schedule for an M^X/G/1 queueing system with an unreliable server
From MaRDI portal
Publication:361585
Summary: We consider a batch arrival queueing system with an unreliable server. If the queue is empty at a service completion, then the server becomes inactive and begins an idle period. However, if the queue is not empty, then the server will take at most \(K\) vacation before serving the next customer. A linear cost structure is developed for the system and the optimal value of \(K\) is obtained.
Recommendations
- Binomial schedule for an M/G/1 type queueing system with an unreliable server under \(N\)-policy
- The \(\text{M}^X/\text{G}/1\) queue with unreliable server, delayed repairs, and Bernoulli vacation schedule under \(T\)-policy
- An $M^{[X]}/G(a,b)/1$ queue with unreliable server, re-service on server's decision, balking and Bernoulli vacation schedule under multiple vacation policy
- The optimal control of an unreliable server queue with two phases of service and Bernoulli vacation schedule
- Analysis of a bulk queue with unreliable server and single vacation
Cites work
- Generalizations of the stochastic decomposition results for single server queues with vacations
- scientific article; zbMATH DE number 50893 (Why is no real title available?)
- scientific article; zbMATH DE number 3892339 (Why is no real title available?)
- M/G/1 queues with postponed interruptions
- Markov chains with transition delta-matrix: Ergodicity conditions, invariant probability measures and applications
- Optimal design and control of queues
- Optimal Design of Queueing Systems
- Queueing systems with vacations - a survey
Cited in
(4)- On some compound random variables motivated by bulk queues
- Binomial schedule for an M/G/1 type queueing system with an unreliable server under \(N\)-policy
- The \(\text{M}^X/\text{G}/1\) queue with unreliable server, delayed repairs, and Bernoulli vacation schedule under \(T\)-policy
- A note on reliability analysis of an N-policy unreliable MX / (G1G2) /1 queue with optional repeated service
This page was built for publication: Note on a binomial schedule for an M\(^{X}\)/G/1 queueing system with an unreliable server
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q361585)