Makespan Minimization

Makespan Minimization is a scheduling optimization problem in which the objective is to construct a feasible schedule that minimizes the makespan, i.e., the maximum completion time over all jobs or tasks.

1.4K

Publications

67.7K

Citations

2.5K

Authors

988

Institutions

Publications per year

2017–2026

393

Authors

2.5K

  1. TC
    T.C.E. Cheng

    Hong Kong Polytechnic University, Hong Kong SAR China

    39 publications · 1.8K citations

    23

    h-index

  2. KY
    Kuo‐Ching Ying

    National Taipei University of Technology, Taiwan

    26 publications · 1.3K citations

    20

    h-index

  3. AA
    Ali Allahverdi

    Kuwait University, Kuwait

    21 publications · 975 citations

    19

    h-index

  4. JY
    Jinjiang Yuan

    Zhengzhou University, China

    29 publications · 749 citations

    18

    h-index

  5. JN
    Jatinder N.D. Gupta

    University of Alabama in Huntsville, United States

    21 publications · 898 citations

    18

    h-index

1–5 of 2.5K

Venues

  1. International Journal of Production Research

    141 publications · 7.2K citations

    51

    h-index

  2. European Journal of Operational Research

    71 publications · 5.7K citations

    40

    h-index

  3. Computers & Operations Research

    71 publications · 4.2K citations

    39

    h-index

  4. 27

    h-index

  5. International Journal of Production Economics

    30 publications · 1.7K citations

    24

    h-index

1–5