Single-machine Scheduling
Single-Machine Scheduling is a scheduling theory problem that involves sequencing a set of jobs on a single machine to optimize a given objective function, distinguished from other scheduling problems by the constraint that only one job can be processed at a time without preemption.
1.7K
Publications
82.9K
Citations
2.2K
Authors
947
Institutions
Publications per year
2017–2026
243
1.7K
An Algorithm for Solving the Job-Shop Problem
Jacques Carlier, Éric Pinson · Management Science · 1989 · 813 citations
1–5 of 1.7K
2.2K
42
h-index
36
h-index
32
h-index
31
h-index
24
h-index
1–5 of 2.2K
947

Hong Kong Polytechnic University
Hong Kong, Hong Kong
43 h-index
188 publications
8.7K citations
Feng Chia University
Taichung, Taiwan
37 h-index
140 publications
5.8K citations
Shenyang Aerospace University
Shenyang, China
35 h-index
220 publications
7.4K citations
Dalian University of Technology
Dalian, China
29 h-index
90 publications
2.8K citations

Centre National de la Recherche Scientifique
Paris, France
25 h-index
85 publications
3K citations

Zhengzhou University
Zhengzhou, China
23 h-index
102 publications
3.3K citations
United Institute of Informatics Problems
Minsk, Belarus
22 h-index
30 publications
1.6K citations

Northeastern University
Shenyang, China
21 h-index
61 publications
1.8K citations
1–8 of 947
155 publications · 9K citations
52
h-index
124 publications · 5.2K citations
42
h-index
90 publications · 3.6K citations
38
h-index
52 publications · 6.4K citations
37
h-index
49 publications · 7.4K citations
34
h-index
1–5