Performance evaluation and dimensioning of \(GI^X/M/c/N\) systems through kernel estimation (Q410362): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Summary: We extend the analysis of queueing systems for real-life situations, where the arrival pattern of customers is unknown. In real systems, we must understand how the choice of a method of estimation influences the configuration of the system. Using kernel smoothing, we evaluate algorithms to estimate performance measures of a \(GI^X/M/c/N\) system, including the invariant probability distribution of the number of customers in the system, the blocking probability, the average queue size, and the average client queue time. We successfully apply the method to the arrivals to a call center to plan and improve the performance of these important queueing systems. | |||
| Property / review text: Summary: We extend the analysis of queueing systems for real-life situations, where the arrival pattern of customers is unknown. In real systems, we must understand how the choice of a method of estimation influences the configuration of the system. Using kernel smoothing, we evaluate algorithms to estimate performance measures of a \(GI^X/M/c/N\) system, including the invariant probability distribution of the number of customers in the system, the blocking probability, the average queue size, and the average client queue time. We successfully apply the method to the arrivals to a call center to plan and improve the performance of these important queueing systems. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B22 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6021071 / rank | |||
Normal rank | |||
Revision as of 19:25, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Performance evaluation and dimensioning of \(GI^X/M/c/N\) systems through kernel estimation |
scientific article |
Statements
Performance evaluation and dimensioning of \(GI^X/M/c/N\) systems through kernel estimation (English)
0 references
3 April 2012
0 references
Summary: We extend the analysis of queueing systems for real-life situations, where the arrival pattern of customers is unknown. In real systems, we must understand how the choice of a method of estimation influences the configuration of the system. Using kernel smoothing, we evaluate algorithms to estimate performance measures of a \(GI^X/M/c/N\) system, including the invariant probability distribution of the number of customers in the system, the blocking probability, the average queue size, and the average client queue time. We successfully apply the method to the arrivals to a call center to plan and improve the performance of these important queueing systems.
0 references
