Queueing System with On-Demand Number of Servers
Vladimir Mazalov; Andrei Gurtov
Mathematica Applicanda (2012)
- Volume: 40, Issue: 2
- ISSN: 1730-2668
Access Full Article
topAbstract
topHow to cite
topVladimir Mazalov, and Andrei Gurtov. "Queueing System with On-Demand Number of Servers." Mathematica Applicanda 40.2 (2012): null. <http://eudml.org/doc/293395>.
@article{VladimirMazalov2012,
abstract = {We consider a queuing system where the number of active serverschanges depending on the length of the queue. As a practical example ofsuch system, we consider the security check queue at the airports. Thenumber of active servers increases when the queue grows by k customersand decreases accordingly. That allows to save server resources whilemaintaining acceptable performance (average queuing time and its variation)for customers. We obtain a closed-form solution for the servingtime, queue length and average number of servers.To validate the model we have selected the data of Dallas Fort internationalairport, the 8th largest in the world. Our simulation modelshows a close match with analytic results. Cost savings in the number ofopen servers are achievable while providing acceptable waiting time forthe customers.},
author = {Vladimir Mazalov, Andrei Gurtov},
journal = {Mathematica Applicanda},
keywords = {dynamic queue},
language = {eng},
number = {2},
pages = {null},
title = {Queueing System with On-Demand Number of Servers},
url = {http://eudml.org/doc/293395},
volume = {40},
year = {2012},
}
TY - JOUR
AU - Vladimir Mazalov
AU - Andrei Gurtov
TI - Queueing System with On-Demand Number of Servers
JO - Mathematica Applicanda
PY - 2012
VL - 40
IS - 2
SP - null
AB - We consider a queuing system where the number of active serverschanges depending on the length of the queue. As a practical example ofsuch system, we consider the security check queue at the airports. Thenumber of active servers increases when the queue grows by k customersand decreases accordingly. That allows to save server resources whilemaintaining acceptable performance (average queuing time and its variation)for customers. We obtain a closed-form solution for the servingtime, queue length and average number of servers.To validate the model we have selected the data of Dallas Fort internationalairport, the 8th largest in the world. Our simulation modelshows a close match with analytic results. Cost savings in the number ofopen servers are achievable while providing acceptable waiting time forthe customers.
LA - eng
KW - dynamic queue
UR - http://eudml.org/doc/293395
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.