Parallel Scheduling Algorithms

Parallel Scheduling Algorithms is a class of computational methods designed to allocate tasks across multiple processing units in a parallel computing environment, distinguished by their ability to optimize resource utilization and execution time through strategic assignment and ordering of interdependent tasks.

804

Publications

38.5K

Citations

1.6K

Authors

762

Institutions

Publications per year

2017–2026

133

Authors

1.6K

  1. TC
    T.C.E. Cheng

    Hong Kong Polytechnic University, Hong Kong SAR China

    11 publications · 467 citations

    11

    h-index

  2. HC
    Henri Casanova

    University of Hawaiʻi at Mānoa, United States

    10 publications · 989 citations

    10

    h-index

  3. DT
    Denis Trystram

    Université Grenoble Alpes, France

    9 publications · 247 citations

    9

    h-index

  4. KJ
    Klaus Jansen

    Christian-Albrechts-Universität zu Kiel, Germany

    8 publications · 340 citations

    8

    h-index

  5. CL
    Chung‐Yee Lee

    Hong Kong University of Science and Technology, Hong Kong SAR China

    6 publications · 972 citations

    6

    h-index

1–5 of 1.6K

Venues

  1. Computers & Operations Research

    42 publications · 2.3K citations

    29

    h-index

  2. European Journal of Operational Research

    36 publications · 1.9K citations

    26

    h-index

  3. Computers & Industrial Engineering

    32 publications · 1.8K citations

    25

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 22 publications · 1.8K citations

    19

    h-index

  5. Journal of Scheduling

    JOS · 18 publications · 719 citations

    15

    h-index

1–5