Note on a binomial schedule for an M\(^{X}\)/G/1 queueing system with an unreliable server (Q361585)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Note on a binomial schedule for an M\(^{X}\)/G/1 queueing system with an unreliable server |
scientific article; zbMATH DE number 6203001
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on a binomial schedule for an M\(^{X}\)/G/1 queueing system with an unreliable server |
scientific article; zbMATH DE number 6203001 |
Statements
Note on a binomial schedule for an M\(^{X}\)/G/1 queueing system with an unreliable server (English)
0 references
29 August 2013
0 references
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.
0 references
unreliable server
0 references
batch arrival queueing system
0 references
linear cost structure
0 references
0 references
0 references
