Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues
2016; Institute for Operations Research and the Management Sciences; Volume: 41; Issue: 3 Linguagem: Inglês
10.1287/moor.2015.0768
ISSN1526-5471
Autores Tópico(s)Simulation Techniques and Applications
ResumoA single queueing station serving K input streams with renewal arrivals and generally distributed independent and identically distributed service times is considered. Customers are served by the Shortest Remaining Processing Time policy. In the case of a tie, the first-in, first-out policy is utilized. We analyze a fluid model for the evolution of a measure-valued state descriptor of this system, with particular emphasis on its limiting behavior in the critical case as time gets large. We also prove a fluid limit theorem justifying our fluid model as the first-order approximation of the queueing system under consideration. Along the way, we establish fluid limits for the corresponding state-dependent response times.
Referência(s)