Optimal \((d,c)\) vacation policy for a finite buffer \(M/M/c\) queue with unreliable servers and repairs. (Q965554)
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: Optimal \((d,c)\) vacation policy for a finite buffer \(M/M/c\) queue with unreliable servers and repairs. |
scientific article; zbMATH DE number 5701222
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal \((d,c)\) vacation policy for a finite buffer \(M/M/c\) queue with unreliable servers and repairs. |
scientific article; zbMATH DE number 5701222 |
Statements
Optimal \((d,c)\) vacation policy for a finite buffer \(M/M/c\) queue with unreliable servers and repairs. (English)
0 references
24 April 2010
0 references
direct search algorithm
0 references
Markovian queue
0 references
server vacations
0 references
unreliable servers
0 references
average profit
0 references
0 references
0 references
0 references
