Scheduling Problems
Scheduling Problems is a class of discrete optimization problems in integer programming that involves assigning a set of tasks to resources over time under specific constraints, distinguished by the requirement to determine both the sequencing and timing of operations to optimize an objective function.
3.5K
Publications
228.9K
Citations
6.6K
Authors
1.9K
Institutions
Publications per year
2017–2026
786
3.5K
Scheduling: Theory, Algorithms, and Systems
Michael Pinedo · IIE Transactions · 1996 · 6.3K citations
The Complexity of Flowshop and Jobshop Scheduling
M. R. Garey, David Johnson, Ravi Sethi · Mathematics of Operations Research · 1976 · 2.6K citations
Benchmarks for basic scheduling problems
Éric D. Taillard · European Journal of Operational Research · 1993 · 2.4K citations
1–5 of 3.5K
6.6K
24
h-index
22
h-index
19
h-index
19
h-index
17
h-index
1–5 of 6.6K
1.9K
Carnegie Mellon University
Pittsburgh, United States
42 h-index
126 publications
15K citations
Massachusetts Institute of Technology
Cambridge, United States
32 h-index
67 publications
5.5K citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
31 h-index
76 publications
6.8K citations
University of Michigan
Ann Arbor, United States
26 h-index
43 publications
3.6K citations
Georgia Institute of Technology
Atlanta, United States
26 h-index
49 publications
6.2K citations
New Jersey Institute of Technology
Newark, United States
25 h-index
41 publications
3.2K citations

Polytechnique Montréal
Montreal, Canada
25 h-index
69 publications
5K citations
Tsinghua University
Beijing, China
25 h-index
83 publications
4.3K citations
1–8 of 1.9K
133 publications · 22.4K citations
73
h-index
186 publications · 18.6K citations
67
h-index
83 publications · 15.5K citations
54
h-index
169 publications · 7K citations
46
h-index
91 publications · 6.4K citations
46
h-index
1–5