Interval Scheduling

Interval Scheduling is a computational optimization problem in algorithm design that involves selecting a maximum-cardinality subset of non-overlapping intervals from a given set of time intervals.

250

Publications

11.6K

Citations

594

Authors

337

Institutions

Publications per year

2017–2026

56

Authors

594

  1. HS
    Hadas Shachnai

    Technion – Israel Institute of Technology, Israel

    7 publications · 386 citations

    7

    h-index

  2. MM
    Magnús M. Halldórsson

    Reykjavík University, Iceland

    5 publications · 307 citations

    5

    h-index

  3. FS
    Frits Spieksma

    KU Leuven, Belgium

    4 publications · 433 citations

    4

    h-index

  4. CC
    Chengbin Chu

    Université de Technologie de Troyes, France

    4 publications · 233 citations

    4

    h-index

  5. YN
    Yuri N. Sotskov

    United Institute of Informatics Problems, Belarus

    4 publications · 78 citations

    4

    h-index

1–5 of 594

Venues

  1. European Journal of Operational Research

    11 publications · 673 citations

    10

    h-index

  2. Discrete Applied Mathematics

    7 publications · 356 citations

    7

    h-index

  3. Computers & Industrial Engineering

    7 publications · 298 citations

    7

    h-index

  4. Computers & Operations Research

    7 publications · 219 citations

    7

    h-index

  5. International Journal of Production Research

    7 publications · 246 citations

    7

    h-index

1–5