Diffusion limits for shortest remaining processing time queues
We present a heavy traffic analysis for a single server queue with renewal arrivals and generally distributed i.i.d. service times, in which the server employs the Shortest Remaining Processing Time (SRPT) policy. Under typical heavy traffic assumptions, we prove a diffusion limit theorem for a meas...
Main Authors: | Amber L. Puha, Łukasz Kruk, H. Christian Gromoll |
---|---|
Format: | Article |
Language: | English |
Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2011-01-01
|
Series: | Stochastic Systems |
Subjects: | |
Online Access: | http://www.i-journals.org/ssy/viewarticle.php?id=16&layout=abstract |
Similar Items
-
The impact of time limitation: Insights from a queueing experiment
by: Anna Conte, et al.
Published: (2016-05-01) -
On the Maximal Shortest Paths Cover Number
by: Iztok Peterin, et al.
Published: (2021-07-01) -
A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation
by: Xianbiao Hu, PhD, et al.
Published: (2015-01-01) -
An FPTAS for Dynamic Multiobjective Shortest Path Problems
by: Pedro Maristany de las Casas, et al.
Published: (2021-01-01) -
Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and Prospects
by: Juarez Machado da Silva, et al.
Published: (2023-03-01)