Single Machine Makespan Minimization

Single Machine Makespan Minimization is a scheduling optimization problem in which the makespan—the total time required to complete all jobs—is minimized on a single machine processing a set of jobs sequentially without preemption.

275

Publications

11.6K

Citations

466

Authors

265

Institutions

Publications per year

2017–2026

43

Authors

466

  1. JW
    Ji‐Bo Wang

    Shenyang Aerospace University, China

    26 publications · 841 citations

    17

    h-index

  2. TC
    T.C.E. Cheng

    Hong Kong Polytechnic University, Hong Kong SAR China

    14 publications · 810 citations

    13

    h-index

  3. DY
    Dar-Li Yang

    National Formosa University, Taiwan

    11 publications · 579 citations

    11

    h-index

  4. CW
    Chin‐Chia Wu

    Feng Chia University, Taiwan

    10 publications · 527 citations

    10

    h-index

  5. WL
    Wen‐Chiung Lee

    Feng Chia University, Taiwan

    10 publications · 594 citations

    10

    h-index

1–5 of 466

Venues

  1. Computers & Operations Research

    20 publications · 974 citations

    19

    h-index

  2. International Journal of Production Research

    18 publications · 1.2K citations

    16

    h-index

  3. European Journal of Operational Research

    21 publications · 1.8K citations

    16

    h-index

  4. Applied Mathematical Modelling

    19 publications · 848 citations

    15

    h-index

  5. 13

    h-index

1–5