Uniform Parallel Machine Scheduling
Uniform Parallel Machine Scheduling is a deterministic scheduling model in which a set of independent jobs are assigned to a set of parallel machines having different but constant processing speeds, such that the completion time of the last job across all machines—known as the makespan—is minimized.
89
Publications
3.2K
Citations
165
Authors
106
Institutions
Publications per year
2017–2026
15
Parents
89
On-line scheduling on uniform multiprocessors
Shelby Funk, Joël Goossens, Sanjoy Baruah · 2005 · 121 citations
1–5 of 89
165
5
h-index
5
h-index
5
h-index
3
h-index
3
h-index
1–5 of 165
106

Hefei University of Technology
Hefei, China
6 h-index
21 publications
505 citations
Decision Sciences (United States)
Fort Walton Beach, United States
6 h-index
12 publications
378 citations
Ministry of Education of the People's Republic of China
Beijing, China
5 h-index
10 publications
213 citations
Hebrew University of Jerusalem
Jerusalem, Israel
5 h-index
10 publications
206 citations
Florida International University
Miami, United States
5 h-index
10 publications
288 citations
United Institute of Informatics Problems
Minsk, Belarus
4 h-index
5 publications
104 citations
Feng Chia University
Taichung, Taiwan
4 h-index
4 publications
159 citations
University of California, Berkeley
Berkeley, United States
3 h-index
3 publications
410 citations
1–8 of 106
11 publications · 359 citations
11
h-index
10 publications · 316 citations
10
h-index
4 publications · 137 citations
4
h-index
JOS · 3 publications · 114 citations
3
h-index
3 publications · 172 citations
3
h-index
1–5