Online Flow-time Minimization
Online Flow-Time Minimization is an online scheduling objective that belongs to the class of performance optimization criteria in real-time job scheduling, distinguished by its aim to minimize the cumulative time jobs spend in the system from their arrival to their completion under irrevocable scheduling decisions.
52
Publications
1.7K
Citations
100
Authors
65
Institutions
Publications per year
2017–2026
6
Parents
52
On scheduling in map-reduce and flow-shops
Benjamin Moseley, Anirban Dasgupta, Ravi Kumar et al. · 2011 · 114 citations
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 52
100
8
h-index
7
h-index
5
h-index
5
h-index
4
h-index
1–5 of 100
65
Indian Institute of Technology Delhi
New Delhi, India
4 h-index
10 publications
581 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
4 h-index
8 publications
141 citations
University of Pittsburgh
Pittsburgh, United States
3 h-index
3 publications
105 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
3 h-index
5 publications
91 citations
Duke University
Durham, United States
2 h-index
4 publications
110 citations
Dalle Molle Institute for Artificial Intelligence Research
Lugano, Switzerland
2 h-index
3 publications
66 citations
Nokia (United States)
Coppell, United States
2 h-index
2 publications
321 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
3 publications
138 citations
1–8 of 65
5 publications · 130 citations
5
h-index
TALG · 3 publications · 71 citations
3
h-index
Repository · 3 publications · 61 citations
3
h-index
3 publications · 66 citations
3
h-index
JOS · 2 publications · 37 citations
2
h-index
1–5