Makespan Minimization
Makespan Minimization is a scheduling optimization problem in which the objective is to construct a feasible schedule that minimizes the makespan, i.e., the maximum completion time over all jobs or tasks.
1.4K
Publications
67.7K
Citations
2.5K
Authors
988
Institutions
Publications per year
2017–2026
393
1.4K
1–5 of 1.4K
2.5K
23
h-index
20
h-index
19
h-index
18
h-index
University of Alabama in Huntsville, United States
21 publications · 898 citations
18
h-index
1–5 of 2.5K
988

Hong Kong Polytechnic University
Hong Kong, Hong Kong
26 h-index
84 publications
3.6K citations
Tsinghua University
Beijing, China
25 h-index
69 publications
5.1K citations
Kuwait University
Kuwait City, Kuwait
19 h-index
27 publications
1.4K citations

Zhengzhou University
Zhengzhou, China
19 h-index
75 publications
2K citations
Liaocheng University
Liaocheng, China
19 h-index
47 publications
3.3K citations
Amirkabir University of Technology
Tehran, Iran
19 h-index
39 publications
2.4K citations

Huazhong University of Science and Technology
Wuhan, China
19 h-index
67 publications
4.5K citations

National Taipei University of Technology
Taipei, Taiwan
19 h-index
42 publications
1.9K citations
1–8 of 988
141 publications · 7.2K citations
51
h-index
71 publications · 5.7K citations
40
h-index
71 publications · 4.2K citations
39
h-index
48 publications · 1.9K citations
27
h-index
30 publications · 1.7K citations
24
h-index
1–5