We give an O(n log n) time algorithm to preemptively schedule n equal-length jobs with release times on two identical, parallel machines so as to minimize the mean flow time. The complexity of the general problem of minimizing the mean weighted flow time is also reviewed, both for nonpreemptive and preemptive scheduling.
|Original language||English (US)|
|Number of pages||8|
|State||Published - 1990|
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Management Science and Operations Research