Parallel Machine Makespan Minimization

Parallel Machine Makespan Minimization is a scheduling optimization problem that, as a subclass of makespan minimization, involves assigning a set of independent jobs to multiple identical parallel machines in such a way that the maximum completion time across all machines is minimized.

313

Publications

13.4K

Citations

622

Authors

336

Institutions

Publications per year

2017–2026

66

Authors

622

  1. TC
    T.C.E. Cheng

    Hong Kong Polytechnic University, Hong Kong SAR China

    13 publications · 333 citations

    10

    h-index

  2. JY
    Jinjiang Yuan

    Zhengzhou University, China

    12 publications · 329 citations

    10

    h-index

  3. PD
    Purushothaman Damodaran

    Northern Illinois University, United States

    8 publications · 567 citations

    8

    h-index

  4. JY
    Joseph Y.‐T. Leung

    New Jersey Institute of Technology, United States

    8 publications · 462 citations

    8

    h-index

  5. JN
    Jatinder N.D. Gupta

    University of Alabama in Huntsville, United States

    7 publications · 397 citations

    7

    h-index

1–5 of 622

Venues

  1. International Journal of Production Research

    31 publications · 1.6K citations

    22

    h-index

  2. Computers & Operations Research

    15 publications · 603 citations

    15

    h-index

  3. European Journal of Operational Research

    15 publications · 755 citations

    15

    h-index

  4. Naval Research Logistics (NRL)

    15 publications · 615 citations

    13

    h-index

  5. Computers & Industrial Engineering

    10 publications · 487 citations

    10

    h-index

1–5