Three-machine Scheduling

Three-Machine Scheduling is a deterministic scheduling model in the class of parallel machine scheduling problems, distinguished by the allocation of a set of jobs to exactly three identical machines to minimize the makespan, which is the completion time of the last job processed.

46

Publications

2.2K

Citations

101

Authors

62

Institutions

Publications per year

2017–2026

9

Authors

101

  1. AA
    Ali Allahverdi

    Kuwait University, Kuwait

    4 publications · 113 citations

    4

    h-index

  2. HF
    Hanna Furmańczyk

    University of Gdańsk, Poland

    3 publications · 43 citations

    3

    h-index

  3. MK
    Marek Kubale

    University of Gdańsk, Poland

    3 publications · 43 citations

    3

    h-index

  4. CL
    Chung‐Yee Lee

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

    3 publications · 389 citations

    3

    h-index

  5. JC
    Jianer Chen

    Texas A&M University, United States

    2 publications · 95 citations

    2

    h-index

1–5 of 101

Venues

  1. Discrete Applied Mathematics

    5 publications · 267 citations

    5

    h-index

  2. Naval Research Logistics (NRL)

    4 publications · 156 citations

    4

    h-index

  3. Operations Research

    4 publications · 312 citations

    4

    h-index

  4. European Journal of Operational Research

    3 publications · 160 citations

    3

    h-index

  5. Mathematics Magazine

    2 publications · 51 citations

    2

    h-index

1–5