Worst case bound of an LRF schedule for the mean weighted flow-time problem
SIAM Journal on Computing
Scheduling independent tasks to reduce mean finishing time
Communications of the ACM
| Hi-index | 0.89 |
We consider the problem of minimizing the sum of quadratic completion times on two parallel machines and we discuss the approximation ratio of the generalized shortest processing time (GSPT) priority rule according to which the jobs are sorted in non-decreasing processing time order and the next job on the list is assigned to the earliest available machine. We show that the approximation ratio of the GSPT rule is bounded above by 5+25+1~1.309 and below by 6+26+1~1.290. Extensions to the parallel m-machine problem are also discussed.