Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits (Q2115771)

The paper under review derives heavy traffic limit theorems for a single server single customer class queue, in which the server uses the Shortest Remaining Processing Time (SRPT) policy from heavy traffic limits for the corresponding Earliest Deadline First queueing systems extending the results of the earlier paper of this author [Lect. Notes Comput. Sci. 11688, 263--275 (2019; Zbl 1439.90028)]. The analysis of the paper enables us to assume correlation between interarrival and service times and heavy-tailed interarrival and service time distributions, as long as the corresponding stochastic primitive processes converge weakly to continuous limits under heavy traffic scaling. The approach of the paper provides simple, concise justifications and new insights for SRPT heavy traffic limit theorems given in [\textit{H. C. Gromoll} et al., Stoch. Syst. 1, No. 1, 1--16 (2011; Zbl 1291.60187)]. Associated results for the longest remaining processing time policy are provided as well.