Scheduling Problems

Scheduling Problems is a class of discrete optimization problems in integer programming that involves assigning a set of tasks to resources over time under specific constraints, distinguished by the requirement to determine both the sequencing and timing of operations to optimize an objective function.

3.5K

Publications

228.9K

Citations

6.6K

Authors

1.9K

Institutions

Publications per year

2017–2026

786

Authors

6.6K

  1. IE
    Ignacio E. Grossmann

    Carnegie Mellon University, United States

    29 publications · 3.2K citations

    24

    h-index

  2. CC
    Chengbin Chu

    Université de Technologie de Troyes, France

    24 publications · 1.5K citations

    22

    h-index

  3. MZ
    MengChu Zhou

    New Jersey Institute of Technology, United States

    20 publications · 1.7K citations

    19

    h-index

  4. CT
    Christos T. Maravelias

    University of Wisconsin–Madison, United States

    21 publications · 849 citations

    19

    h-index

  5. TC
    T.C.E. Cheng

    Hong Kong Polytechnic University, Hong Kong SAR China

    19 publications · 2.6K citations

    17

    h-index

1–5 of 6.6K

Venues

  1. Operations Research

    133 publications · 22.4K citations

    73

    h-index

  2. European Journal of Operational Research

    186 publications · 18.6K citations

    67

    h-index

  3. Management Science

    83 publications · 15.5K citations

    54

    h-index

  4. International Journal of Production Research

    169 publications · 7K citations

    46

    h-index

  5. Industrial & Engineering Chemistry Research

    91 publications · 6.4K citations

    46

    h-index

1–5