Minimizing mean flow time with release time constraint
Theoretical Computer Science
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
SRPT is 1.86-competitive for completion time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Efficient algorithms for average completion time scheduling
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On-line scheduling to minimize average completion time revisited
Operations Research Letters
| Hi-index | 0.00 |
We consider the online scheduling problem of minimizing the total weighted and unweighted completion time on identical parallel machines with preemptible jobs. We show a new general lower bound of 21/19≈1.105 on the competitive ratio of any deterministic online algorithm for the unweighted problem and $\frac{16-\sqrt{14}}{11} \approx 1.114$ for the weighted problem. We then analyze the performance of the natural online algorithm WSRPT (Weighted Shortest Remaining Processing Time). We show that WSRPT is 2-competitive. We also prove that the lower bound on the competitive ratio of WSRPT for this problem is 1.215.