A single server queue with random arrivals and balking: Confidence interval estimation (Q756337)
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: Publication:756337 |
scientific article; zbMATH DE number 4190952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A single server queue with random arrivals and balking: Confidence interval estimation |
scientific article; zbMATH DE number 4190952 |
Statements
A single server queue with random arrivals and balking: Confidence interval estimation (English)
0 references
1990
0 references
A single server works a shift of length L with customers arriving according to a Poisson process rate \(\lambda\) ; arriving customers finding the server busy leave without service and the server works overtime, if necessary, at the end of the shift to complete service of a customer being served at that time. For a single shift, distributional properties of the number of services (X), the overtime worked (Y), and the total server idle time (T) are derived both unconditionally and conditional on the number of arrivals (n), when the arrival times are not recorded. These are used to provide estimates and confidence intervals for parameters from a single realization of the queue over a shift. When the service times are fixed (w), estimates of w are given when (n,X) or (n,T) are observed, and it is noted that confidence intervals based on T are shorter than those based on X for all confidence coefficients.
0 references
Poisson arrivals
0 references
single server queue
0 references
balking
0 references
conditional distributions
0 references
maximum likelihood
0 references
confidence limits
0 references
Poisson process
0 references
confidence intervals
0 references
0.7844862937927246
0 references
0.7833682894706726
0 references
0.7260442972183228
0 references