Online Parallel Machine Scheduling

Online Parallel Machine Scheduling is a computational scheduling model within operations research and theoretical computer science that involves assigning a sequence of jobs arriving over time to multiple identical parallel machines with the objective of optimizing a performance metric under online constraints, where decisions must be made without knowledge of future job arrivals.

68

Publications

2.2K

Citations

134

Authors

82

Institutions

Publications per year

2017–2026

4

Authors

134

  1. JY
    Jinjiang Yuan

    Zhengzhou University, China

    7 publications · 132 citations

    7

    h-index

  2. TC
    T.C.E. Cheng

    Hong Kong Polytechnic University, Hong Kong SAR China

    5 publications · 126 citations

    5

    h-index

  3. CN
    C.T. Ng

    Hong Kong Polytechnic University, Hong Kong SAR China

    4 publications · 68 citations

    4

    h-index

  4. RF
    Ruyan Fu

    Zhengzhou University, China

    4 publications · 84 citations

    4

    h-index

  5. XL
    Xiwen Lu

    East China University of Science and Technology, China

    4 publications · 73 citations

    4

    h-index

1–5 of 134

Venues

  1. Theoretical Computer Science

    7 publications · 205 citations

    7

    h-index

  2. Journal of Combinatorial Optimization

    5 publications · 119 citations

    5

    h-index

  3. Operations Research Letters

    4 publications · 84 citations

    4

    h-index

  4. Computers & Operations Research

    3 publications · 57 citations

    3

    h-index

  5. Information Processing Letters

    2 publications · 25 citations

    2

    h-index

1–5