On transient queue-size distribution in the batch arrival system with the \(N\)-policy and setup times (Q2915740)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6083591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On transient queue-size distribution in the batch arrival system with the \(N\)-policy and setup times |
scientific article; zbMATH DE number 6083591 |
Statements
18 September 2012
0 references
batch arrival queueing system
0 references
\(N\)-policy
0 references
queue-size distribution
0 references
setup time
0 references
transient state
0 references
On transient queue-size distribution in the batch arrival system with the \(N\)-policy and setup times (English)
0 references
The paper under review studies a single-server queueing system with batch Poisson arrivals, generally distributed service times, \(N\)-policy and setup times in exhaustive regime. That is, a busy period starts when there are at least \(N\) customers in the system, and the first service in a busy period is preceded by a random setup time. The paper derives the Laplace-Stieltjes transform of the transient queue-size distribution. A numerical study of different cases is provided.
0 references
0.8459863662719727
0 references
0.8361414074897766
0 references
0.8171786665916443
0 references
0.8165568709373474
0 references
0.8138817548751831
0 references