Shortest Remaining Processing Time

Shortest Remaining Processing Time is a preemptive scheduling discipline that belongs to the class of queue prioritization policies, distinguished by selecting for execution the process with the least remaining burst time, thereby enabling dynamic reordering in response to newly arrived or ongoing tasks.

37

Publications

1.5K

Citations

80

Authors

41

Institutions

Publications per year

2017–2026

5

Authors

80

  1. AW
    Adam Wierman

    California Institute of Technology, United States

    4 publications · 163 citations

    4

    h-index

  2. RW
    Richard Weber

    University of Cambridge, United Kingdom

    2 publications · 105 citations

    2

    h-index

  3. JM
    Jason McCullough

    University of California, Los Angeles, United States

    2 publications · 44 citations

    2

    h-index

  4. SC
    Songqing Chen

    George Mason University, United States

    2 publications · 30 citations

    2

    h-index

  5. MN
    Misja Nuyens

    Vrije Universiteit Amsterdam, Netherlands

    2 publications · 61 citations

    2

    h-index

1–5 of 80

Venues

  1. Operations Research

    4 publications · 549 citations

    4

    h-index

  2. International Journal of Production Research

    3 publications · 173 citations

    3

    h-index

  3. Journal of Applied Probability

    JAP · 2 publications · 105 citations

    2

    h-index

  4. ACM SIGMETRICS Performance Evaluation Review

    PER · 2 publications · 27 citations

    2

    h-index

  5. A I I E Transactions

    1 publications · 26 citations

    1

    h-index

1–5