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

Authors

100

  1. BM
    Benjamin Moseley

    Washington University in St. Louis, United States

    8 publications · 235 citations

    8

    h-index

  2. SI
    Sungjin Im

    University of California, Merced, United States

    7 publications · 141 citations

    7

    h-index

  3. KP
    Kirk Pruhs

    University of Pittsburgh, United States

    5 publications · 151 citations

    5

    h-index

  4. NB
    Nikhil Bansal

    IBM (United States), United States

    5 publications · 108 citations

    5

    h-index

  5. AK
    Amit Kumar

    Indian Institute of Technology Delhi, India

    4 publications · 248 citations

    4

    h-index

1–5 of 100

Venues

  1. Computers & Industrial Engineering

    5 publications · 130 citations

    5

    h-index

  2. ACM Transactions on Algorithms

    TALG · 3 publications · 71 citations

    3

    h-index

  3. TU/e Research Portal (Eindhoven University of Technology)

    Repository · 3 publications · 61 citations

    3

    h-index

  4. European Journal of Operational Research

    3 publications · 66 citations

    3

    h-index

  5. Journal of Scheduling

    JOS · 2 publications · 37 citations

    2

    h-index

1–5