Online Single-Machine Scheduling is a computational optimization problem in scheduling theory where jobs arrive over time and must be sequentially assigned to a single processing machine with no prior knowledge of future job characteristics, distinguishing it from offline scheduling by its real-time decision-making constraint.
74
Publications
2.3K
Citations
162
Authors
96
Institutions
Publications per year
2017–2026
17
Parents
Publications
74
Multi-processor scheduling to minimize flow time with ε resource augmentation
Chandra Chekuri, Ashish Goel, Sanjeev Khanna et al. · 2004 · 91 citations
Algorithms for minimizing weighted flow time
Chandra Chekuri, Sanjeev Khanna, An Zhu · 2001 · 90 citations
1–5 of 74
Authors
162
- JW
8
h-index
- FZ
5
h-index
- WL
4
h-index
- ML
4
h-index
- YX
4
h-index
1–5 of 162
Institutions
96
Shenyang Aerospace University
Shenyang, China
13 h-index
25 publications
1K citations
Xi'an Jiaotong University
Xi'an, China
8 h-index
18 publications
393 citations
Feng Chia University
Taichung, Taiwan
5 h-index
9 publications
304 citations
Zhengzhou University
Zhengzhou, China
4 h-index
9 publications
134 citations
Dalian University of Technology
Dalian, China
4 h-index
5 publications
199 citations
Tongji University
Shanghai, China
3 h-index
6 publications
99 citations
University of Florida
Gainesville, United States
3 h-index
5 publications
159 citations
Google (United States)
Mountain View, United States
3 h-index
5 publications
120 citations
1–8 of 96
Venues
- European Journal of Operational Research
7 publications · 238 citations
7
h-index
- Applied Mathematical Modelling
7 publications · 172 citations
7
h-index
- Computers & Industrial Engineering
7 publications · 261 citations
7
h-index
- The International Journal of Advanced Manufacturing Technology
4 publications · 112 citations
4
h-index
- Theoretical Computer Science
4 publications · 63 citations
4
h-index
1–5