Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Bi-objective Optimization: An Online Algorithm for Job Assignment
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Hi-index | 0.00 |
We give a simple proof that, for any instance of a very general class of scheduling problems, there exists a schedule of makespan at most twice that of the optimal possible and of total weighted completion time at most twice that of the optimal possible. We then refine the analysis, yielding variants of this theorem with improved constants, and give some algorithmic consequences of the technique.