TY - GEN

T1 - Improved online algorithm for weighted flow time

AU - Azar, Yossi

AU - Touitou, Noam

N1 - Publisher Copyright: © 2018 IEEE.

PY - 2018/11/30

Y1 - 2018/11/30

N2 - We discuss one of the most fundamental scheduling problem of processing jobs on a single machine to minimize the weighted fow time (weighted response time). Our main result is a O(log P)-competitive algorithm, where P is the maximum-to-minimum processing time ratio, improving upon the O(log 2 P)-competitive algorithm of Chekuri, Khanna and Zhu (STOC 2001). We also design a O(log D)-competitive algorithm, where D is the maximum-to-minimum density ratio of jobs. Finally, we show how to combine these results with the result of Bansal and Dhamd-here (SODA 2003) to achieve a O(log(min(P, D, W)))-competitive algorithm (where W is the maximum-to-minimum weight ratio), without knowing P, D, W in advance. As shown by Bansal and Chan (SODA 2009), no constant-competitive algorithm is achievable for this problem.

AB - We discuss one of the most fundamental scheduling problem of processing jobs on a single machine to minimize the weighted fow time (weighted response time). Our main result is a O(log P)-competitive algorithm, where P is the maximum-to-minimum processing time ratio, improving upon the O(log 2 P)-competitive algorithm of Chekuri, Khanna and Zhu (STOC 2001). We also design a O(log D)-competitive algorithm, where D is the maximum-to-minimum density ratio of jobs. Finally, we show how to combine these results with the result of Bansal and Dhamd-here (SODA 2003) to achieve a O(log(min(P, D, W)))-competitive algorithm (where W is the maximum-to-minimum weight ratio), without knowing P, D, W in advance. As shown by Bansal and Chan (SODA 2009), no constant-competitive algorithm is achievable for this problem.

UR - http://www.scopus.com/inward/record.url?scp=85059819017&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/FOCS.2018.00048

DO - https://doi.org/10.1109/FOCS.2018.00048

M3 - منشور من مؤتمر

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 427

EP - 437

BT - Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018

A2 - Thorup, Mikkel

PB - IEEE Computer Society

T2 - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018

Y2 - 7 October 2018 through 9 October 2018

ER -