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

Authors

215

  1. GD
    György Dósa

    University of Pannonia, Hungary

    4 publications · 69 citations

    4

    h-index

  2. DT
    Don Towsley

    University of Massachusetts Amherst, United States

    2 publications · 39 citations

    2

    h-index

  3. NC
    Nanfang Cui

    Huazhong University of Science and Technology, China

    2 publications · 50 citations

    2

    h-index

  4. XC
    Xin Chen

    Dalian University of Technology, China

    2 publications · 29 citations

    2

    h-index

  5. LE
    Leah Epstein

    University of Haifa, Israel

    2 publications · 40 citations

    2

    h-index

1–5 of 215

Venues

  1. European Journal of Operational Research

    5 publications · 347 citations

    5

    h-index

  2. Computers & Operations Research

    4 publications · 188 citations

    4

    h-index

  3. International Journal of Production Economics

    3 publications · 82 citations

    3

    h-index

  4. Computers & Industrial Engineering

    3 publications · 110 citations

    3

    h-index

  5. Information Processing Letters

    2 publications · 32 citations

    2

    h-index

1–5