Identical Parallel Machine Scheduling
Identical Parallel Machine Scheduling is a scheduling framework in which a set of non-preemptive jobs are assigned to multiple identical parallel machines with the objective of minimizing makespan, distinguished from other parallel machine models by the uniformity of machine processing speeds.
292
Publications
12.2K
Citations
543
Authors
321
Institutions
Publications per year
2017–2026
54
292
Approximation schemes for minimizing average weighted completion time with release dates
Foto Afrati, Evripidis Bampis, Chandra Chekuri et al. · 2003 · 207 citations · Full text
1–5 of 292
543
University of Alabama in Huntsville, United States
12 publications · 503 citations
12
h-index
6
h-index
6
h-index
6
h-index
6
h-index
1–5 of 543
321

Centre National de la Recherche Scientifique
Paris, France
12 h-index
37 publications
1.4K citations
Université de Technologie de Troyes
Troyes, France
7 h-index
22 publications
1.3K citations
Tsinghua University
Beijing, China
6 h-index
14 publications
683 citations
University of Alabama in Huntsville
Huntsville, United States
6 h-index
6 publications
280 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
6 h-index
7 publications
163 citations
Hebrew University of Jerusalem
Jerusalem, Israel
6 h-index
11 publications
280 citations
Middle East Technical University
Ankara, Türkiye
6 h-index
6 publications
219 citations
Dalian University of Technology
Dalian, China
5 h-index
9 publications
450 citations
1–8 of 321
26 publications · 1.2K citations
21
h-index
36 publications · 1.5K citations
21
h-index
21 publications · 785 citations
17
h-index
12 publications · 519 citations
12
h-index
11 publications · 365 citations
11
h-index
1–5