Optimization by Vector Space Methods
Optimization by Vector Space Methods
SRPT is 1.86-competitive for completion time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Average-case competitive analyses for one-way trading
Journal of Combinatorial Optimization
Efficient algorithms for average completion time scheduling
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Hi-index | 0.89 |
The competitive performance of the SRPT scheduling algorithm has been open for a long time except for being 2-competitive, where the objective is to minimize the total completion time. Chung et al. proved that the SRPT algorithm is 1.857-competitive. In this paper we improve their analysis and show a 1.792-competitiveness. We clearly mention that our result is not the best so far, since Sitters recently proved the algorithm is 1.250-competitive. Nevertheless, it is still well worth reporting our analytical method; our analysis is based on the modern functional optimization, which can scarcely be found in the literature on the analysis of algorithms. Our aim is to illustrate the potentiality of functional optimization with a concrete application.