Queueing-based Scheduling

Queueing-Based Scheduling is a stochastic scheduling framework that allocates resources or prioritizes tasks by modeling job arrivals and service times as queueing processes to optimize performance metrics such as delay, throughput, or fairness.

402

Publications

22.9K

Citations

802

Authors

355

Institutions

Publications per year

2017–2026

43

Authors

802

  1. SA
    Samuli Aalto

    Aalto University, Finland

    8 publications · 287 citations

    8

    h-index

  2. JW
    Jean Walrand

    University of California, Berkeley, United States

    7 publications · 1.7K citations

    7

    h-index

  3. MH
    Mor Harchol‐Balter

    Carnegie Mellon University, United States

    6 publications · 536 citations

    6

    h-index

  4. DS
    Devavrat Shah

    Massachusetts Institute of Technology, United States

    6 publications · 285 citations

    6

    h-index

  5. RS
    R. Srikant

    University of Illinois Urbana-Champaign, United States

    6 publications · 1.1K citations

    6

    h-index

1–5 of 802

Venues

  1. IEEE/ACM Transactions on Networking

    TON · 17 publications · 2.1K citations

    15

    h-index

  2. Operations Research

    15 publications · 2K citations

    13

    h-index

  3. ACM SIGMETRICS Performance Evaluation Review

    PER · 11 publications · 419 citations

    10

    h-index

  4. Advances in Applied Probability

    AAP · 8 publications · 318 citations

    8

    h-index

  5. European Journal of Operational Research

    8 publications · 688 citations

    8

    h-index

1–5