Online Queueing-based Scheduling

Online Queueing-Based Scheduling is a dynamic resource allocation method that organizes and prioritizes incoming tasks in a queue structure for immediate processing decisions upon task arrival, distinguishing it from batch or offline scheduling approaches by its real-time, sequential job commitment under uncertainty.

38

Publications

1.4K

Citations

103

Authors

61

Institutions

Publications per year

2017–2026

11

Authors

103

  1. JY
    Jinjiang Yuan

    Zhengzhou University, China

    3 publications · 38 citations

    3

    h-index

  2. ML
    Ming Liu

    Tongji University, China

    2 publications · 35 citations

    2

    h-index

  3. LE
    Leah Epstein

    University of Haifa, Israel

    1 publications · 23 citations

    2

    h-index

  4. GD
    György Dósa

    University of Pannonia, Hungary

    2 publications · 48 citations

    2

    h-index

  5. FZ
    Feifeng Zheng

    Donghua University, China

    2 publications · 35 citations

    2

    h-index

1–5 of 103

Venues

  1. European Journal of Operational Research

    4 publications · 94 citations

    4

    h-index

  2. Theoretical Computer Science

    4 publications · 65 citations

    4

    h-index

  3. Journal of Combinatorial Optimization

    2 publications · 43 citations

    3

    h-index

  4. Information Processing Letters

    1 publications · 14 citations

    2

    h-index

  5. International Journal of Production Economics

    1 publications · 22 citations

    1

    h-index

1–5