Binomial schedule for an M/G/1 type queueing system with an unreliable server under \(N\)-policy (Q2260529): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59044535, #quickstatements; #temporary_batch_1707161894653 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:29, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Binomial schedule for an M/G/1 type queueing system with an unreliable server under \(N\)-policy |
scientific article |
Statements
Binomial schedule for an M/G/1 type queueing system with an unreliable server under \(N\)-policy (English)
0 references
11 March 2015
0 references
Summary: We consider in this paper an M/G/1 type queueing system with the following extensions. First, the server is unreliable and is subject to random breakdowns. Second, the server also implements the well-known \(N\)-policy. Third, instead of a Bernoulli vacation schedule, the more general notion of binomial schedule with \(K\) vacations is applied. A cost function with two decision variables is developed. A numerical example shows the effect of the system parameters on the optimal management policy.
0 references
