Parallel Machine Makespan Minimization
Parallel Machine Makespan Minimization is a scheduling optimization problem that, as a subclass of makespan minimization, involves assigning a set of independent jobs to multiple identical parallel machines in such a way that the maximum completion time across all machines is minimized.
313
Publications
13.4K
Citations
622
Authors
336
Institutions
Publications per year
2017–2026
66
Parents
313
1–5 of 313
622
10
h-index
10
h-index
8
h-index
8
h-index
7
h-index
1–5 of 622
336

Hong Kong Polytechnic University
Hong Kong, Hong Kong
12 h-index
26 publications
768 citations

Zhengzhou University
Zhengzhou, China
12 h-index
29 publications
886 citations

Hefei University of Technology
Hefei, China
10 h-index
26 publications
1.3K citations
New Jersey Institute of Technology
Newark, United States
9 h-index
9 publications
492 citations
Otto-von-Guericke-Universität Magdeburg
Magdeburg, Germany
7 h-index
7 publications
203 citations
United Institute of Informatics Problems
Minsk, Belarus
7 h-index
7 publications
246 citations

Jinan University
Guangzhou, China
6 h-index
7 publications
288 citations

Christian-Albrechts-Universität zu Kiel
Kiel, Germany
6 h-index
9 publications
154 citations
1–8 of 336
31 publications · 1.6K citations
22
h-index
15 publications · 603 citations
15
h-index
15 publications · 755 citations
15
h-index
15 publications · 615 citations
13
h-index
10 publications · 487 citations
10
h-index
1–5