Single Machine Makespan Minimization
Single Machine Makespan Minimization is a scheduling optimization problem in which the makespan—the total time required to complete all jobs—is minimized on a single machine processing a set of jobs sequentially without preemption.
275
Publications
11.6K
Citations
466
Authors
265
Institutions
Publications per year
2017–2026
43
Parents
275
1–5 of 275
466
17
h-index
13
h-index
11
h-index
10
h-index
10
h-index
1–5 of 466
265
Shenyang Aerospace University
Shenyang, China
21 h-index
71 publications
2.2K citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
17 h-index
44 publications
2.1K citations
National Formosa University
Douliu, Taiwan
14 h-index
20 publications
888 citations
Feng Chia University
Taichung, Taiwan
13 h-index
25 publications
1.3K citations
Dalian University of Technology
Dalian, China
11 h-index
26 publications
563 citations
Nan Kai University of Technology
Nantou City, Taiwan
11 h-index
13 publications
679 citations

Zhengzhou University
Zhengzhou, China
10 h-index
19 publications
547 citations

Xi'an Jiaotong University
Xi'an, China
8 h-index
14 publications
428 citations
1–8 of 265
20 publications · 974 citations
19
h-index
18 publications · 1.2K citations
16
h-index
21 publications · 1.8K citations
16
h-index
19 publications · 848 citations
15
h-index
15 publications · 435 citations
13
h-index
1–5