Single-machine Scheduling

Single-Machine Scheduling is a scheduling theory problem that involves sequencing a set of jobs on a single machine to optimize a given objective function, distinguished from other scheduling problems by the constraint that only one job can be processed at a time without preemption.

1.7K

Publications

82.9K

Citations

2.2K

Authors

947

Institutions

Publications per year

2017–2026

243

Authors

2.2K

  1. TC
    T.C.E. Cheng

    Hong Kong Polytechnic University, Hong Kong SAR China

    99 publications · 4.6K citations

    42

    h-index

  2. CW
    Chin‐Chia Wu

    Feng Chia University, Taiwan

    69 publications · 2.9K citations

    36

    h-index

  3. JW
    Ji‐Bo Wang

    Shenyang Aerospace University, China

    75 publications · 2.6K citations

    32

    h-index

  4. YY
    Yunqiang Yin

    Hong Kong Polytechnic University, Hong Kong SAR China

    51 publications · 1.9K citations

    31

    h-index

  5. WL
    Wen‐Chiung Lee

    Feng Chia University, Taiwan

    34 publications · 1.6K citations

    24

    h-index

1–5 of 2.2K

Venues

  1. European Journal of Operational Research

    155 publications · 9K citations

    52

    h-index

  2. Computers & Operations Research

    124 publications · 5.2K citations

    42

    h-index

  3. Computers & Industrial Engineering

    90 publications · 3.6K citations

    38

    h-index

  4. Operations Research

    52 publications · 6.4K citations

    37

    h-index

  5. Management Science

    49 publications · 7.4K citations

    34

    h-index

1–5