Parallel Machine Due-date Scheduling
Parallel Machine Due-Date Scheduling is a scheduling problem in operations research and production planning where a set of jobs must be assigned to multiple identical parallel machines with the objective of determining optimal due dates and job sequences to minimize penalties associated with earliness, tardiness, or due-date assignment costs.
82
Publications
3.4K
Citations
176
Authors
107
Institutions
Publications per year
2017–2026
11
Parents
82
1–5 of 82
176
5
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 176
107
Feng Chia University
Taichung, Taiwan
3 h-index
4 publications
92 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
3 h-index
5 publications
106 citations
Hebrew University of Jerusalem
Jerusalem, Israel
3 h-index
4 publications
77 citations
University of Alabama in Huntsville
Huntsville, United States
3 h-index
3 publications
91 citations
Case Western Reserve University
Cleveland, United States
3 h-index
3 publications
212 citations
United Institute of Informatics Problems
Minsk, Belarus
3 h-index
3 publications
104 citations
Otto-von-Guericke-Universität Magdeburg
Magdeburg, Germany
3 h-index
3 publications
105 citations
Yonsei University
Seoul, South Korea
3 h-index
6 publications
135 citations
1–8 of 107
14 publications · 695 citations
14
h-index
10 publications · 411 citations
10
h-index
7 publications · 270 citations
7
h-index
OR · 6 publications · 146 citations
6
h-index
5 publications · 244 citations
5
h-index
1–5