Parallel Machine Scheduling is a scheduling model within scheduling theory that assigns a set of jobs to multiple identical, uniform, or unrelated machines operating simultaneously, where the distinguishing feature is that each job can be processed on any machine but only one at a time, and the objective is to optimize performance measures such as makespan, total completion time, or lateness under constraints of machine capacity and job precedence.
1.3K
Publications
59.3K
Citations
2.1K
Authors
897
Institutions
Publications per year
2017–2026
311
Publications
1.3K
1–5 of 1.3K
Authors
2.1K
- TC
26
h-index
- JY
20
h-index
- MP
15
h-index
- DY
12
h-index
- FY
12
h-index
1–5 of 2.1K
Institutions
897
Hong Kong Polytechnic University
Hong Kong, Hong Kong
28 h-index
68 publications
2.5K citations
Hefei University of Technology
Hefei, China
23 h-index
84 publications
3.5K citations
New Jersey Institute of Technology
Newark, United States
21 h-index
23 publications
1.1K citations
Centre National de la Recherche Scientifique
Paris, France
20 h-index
81 publications
3.3K citations
Tsinghua University
Beijing, China
18 h-index
51 publications
2.4K citations
Feng Chia University
Taichung, Taiwan
18 h-index
32 publications
1.3K citations
United Institute of Informatics Problems
Minsk, Belarus
16 h-index
23 publications
815 citations
Ministry of Education of the People's Republic of China
Beijing, China
15 h-index
38 publications
1.6K citations
1–8 of 897
Venues
- Computers & Operations Research
115 publications · 6K citations
48
h-index
- European Journal of Operational Research
106 publications · 5.9K citations
47
h-index
- Computers & Industrial Engineering
82 publications · 3.6K citations
37
h-index
- International Journal of Production Research
100 publications · 3.7K citations
36
h-index
- The International Journal of Advanced Manufacturing Technology
46 publications · 1.7K citations
27
h-index
1–5