Buffer-constrained Scheduling
Buffer-Constrained Scheduling is a scheduling model that regulates task sequencing and resource allocation in finite capacity environments by explicitly incorporating limits on intermediate storage or queue capacity between processing stages, distinguishing it from conventional scheduling approaches that assume unbounded buffers.
87
Publications
3.8K
Citations
215
Authors
118
Institutions
Publications per year
2017–2026
6
Parents
87
1–5 of 87
215
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 215
118

University of Twente
Enschede, The Netherlands
4 h-index
8 publications
296 citations
National University of Singapore
Singapore, Singapore
4 h-index
9 publications
321 citations

University of Minnesota
Minneapolis, United States
3 h-index
4 publications
134 citations
University of Pannonia
Veszprém, Hungary
3 h-index
3 publications
52 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
4 publications
725 citations
IBM (United States)
Armonk, United States
3 h-index
4 publications
51 citations
Sobolev Institute of Mathematics
Novosibirsk, Russia
2 h-index
4 publications
84 citations
Columbia University
New York, United States
2 h-index
2 publications
31 citations
1–8 of 118
5 publications · 347 citations
5
h-index
4 publications · 188 citations
4
h-index
3 publications · 82 citations
3
h-index
3 publications · 110 citations
3
h-index
2 publications · 32 citations
2
h-index
1–5