Min-max Scheduling

Min-Max Scheduling is a scheduling optimization framework that, as a member of the class of makespan minimization methods, specifically aims to minimize the maximum completion time across all machines or processors in a parallel or distributed computing environment.

233

Publications

9.7K

Citations

514

Authors

298

Institutions

Publications per year

2017–2026

45

Authors

514

  1. GM
    Gur Mosheiov

    Hebrew University of Jerusalem, Israel

    12 publications · 443 citations

    11

    h-index

  2. JY
    Joseph Y.‐T. Leung

    New Jersey Institute of Technology, United States

    9 publications · 415 citations

    9

    h-index

  3. BM
    Baruch Mor

    Ariel University, Israel

    6 publications · 175 citations

    6

    h-index

  4. AJ
    Adam Janiak

    Wrocław University of Science and Technology, Poland

    6 publications · 230 citations

    6

    h-index

  5. MY
    Mikhail Y. Kovalyov

    United Institute of Informatics Problems, Belarus

    5 publications · 164 citations

    5

    h-index

1–5 of 514

Venues

  1. European Journal of Operational Research

    26 publications · 1.4K citations

    22

    h-index

  2. Computers & Operations Research

    21 publications · 987 citations

    20

    h-index

  3. Computers & Industrial Engineering

    12 publications · 497 citations

    11

    h-index

  4. International Journal of Production Economics

    11 publications · 643 citations

    11

    h-index

  5. 10

    h-index

1–5