Minimizing mean flow time for UET tasks
ACM Transactions on Algorithms (TALG)
By Joseph Y.-T. Leung, Yumei Huo
Issue Date:April 2006
We consider the problem of scheduling a set of n unit-execution-time (UET) tasks, with precedence constraints, on m ≥ 1 parallel and identical processors so as to minimize the mean flow time. For two processors, the Coffman--Graham algorithm gives a ...