Scheduling Approximation

Scheduling Approximation is a computational framework within approximation algorithms that specifically addresses the allocation of tasks to resources over time by providing near-optimal solutions with provable performance guarantees relative to an ideal optimal schedule.

457

Publications

22.1K

Citations

795

Authors

423

Institutions

Publications per year

2017–2026

55

Authors

795

  1. KJ
    Klaus Jansen

    Christian-Albrechts-Universität zu Kiel, Germany

    21 publications · 798 citations

    15

    h-index

  2. GJ
    Gerhard J. Woeginger

    Graz University of Technology, Austria

    17 publications · 1.3K citations

    14

    h-index

  3. NB
    Nikhil Bansal

    IBM (United States), United States

    13 publications · 383 citations

    12

    h-index

  4. DT
    Denis Trystram

    Université Grenoble Alpes, France

    12 publications · 341 citations

    11

    h-index

  5. HK
    Hans Kellerer

    University of Graz, Austria

    11 publications · 334 citations

    11

    h-index

1–5 of 795

Venues

  1. SIAM Journal on Computing

    19 publications · 2.4K citations

    18

    h-index

  2. European Journal of Operational Research

    23 publications · 860 citations

    18

    h-index

  3. Journal of Scheduling

    JOS · 22 publications · 970 citations

    16

    h-index

  4. Mathematics of Operations Research

    15 publications · 1.1K citations

    13

    h-index

  5. Discrete Applied Mathematics

    12 publications · 406 citations

    12

    h-index

1–5