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
Parents
38
New Ressults on Server Problems
Marek Chrobák, H. Karloof, Tom Payne et al. · SIAM Journal on Discrete Mathematics · 1991 · 211 citations
1–5 of 38
103
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 103
61

Zhengzhou University
Zhengzhou, China
4 h-index
7 publications
91 citations
East China University of Science and Technology
Shanghai, China
2 h-index
6 publications
192 citations
Laboratoire Génie Industriel
Gif-sur-Yvette, France
2 h-index
4 publications
90 citations
Laboratoire Lorrain de Recherche en Informatique et ses Applications
Nancy, France
2 h-index
2 publications
32 citations

École Centrale Paris
Châtenay-Malabry, France
2 h-index
4 publications
90 citations
University of Haifa
Haifa, Israel
2 h-index
1 publications
23 citations
University of Pannonia
Veszprém, Hungary
2 h-index
3 publications
73 citations

Xi'an Jiaotong University
Xi'an, China
2 h-index
5 publications
92 citations
1–8 of 61
4 publications · 94 citations
4
h-index
4 publications · 65 citations
4
h-index
2 publications · 43 citations
3
h-index
1 publications · 14 citations
2
h-index
1 publications · 22 citations
1
h-index
1–5