Uniform Parallel Machine Scheduling

Uniform Parallel Machine Scheduling is a deterministic scheduling model in which a set of independent jobs are assigned to a set of parallel machines having different but constant processing speeds, such that the completion time of the last job across all machines—known as the makespan—is minimized.

89

Publications

3.2K

Citations

165

Authors

106

Institutions

Publications per year

2017–2026

15

Authors

165

  1. GJ
    George J. Kyparisis

    Florida International University, United States

    5 publications · 144 citations

    5

    h-index

  2. GM
    Gur Mosheiov

    Hebrew University of Jerusalem, Israel

    5 publications · 103 citations

    5

    h-index

  3. CK
    Christos Koulamas

    Florida International University, United States

    5 publications · 144 citations

    5

    h-index

  4. MD
    Maged Dessouky

    University of Southern California, United States

    3 publications · 135 citations

    3

    h-index

  5. WL
    Wen‐Chiung Lee

    Feng Chia University, Taiwan

    3 publications · 148 citations

    3

    h-index

1–5 of 165

Venues

  1. European Journal of Operational Research

    11 publications · 359 citations

    11

    h-index

  2. Computers & Operations Research

    10 publications · 316 citations

    10

    h-index

  3. International Journal of Production Economics

    4 publications · 137 citations

    4

    h-index

  4. Journal of Scheduling

    JOS · 3 publications · 114 citations

    3

    h-index

  5. Naval Research Logistics (NRL)

    3 publications · 172 citations

    3

    h-index

1–5