Improved online algorithm for weighted flow time

Yossi Azar, Noam Touitou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018
EditorsMikkel Thorup
PublisherIEEE Computer Society
Pages427-437
Number of pages11
ISBN (Electronic)9781538642306
DOIs
StatePublished - 30 Nov 2018
Event59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018 - Paris, France
Duration: 7 Oct 20189 Oct 2018

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume2018-October
ISSN (Print)0272-5428

Conference

Conference59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018
Country/TerritoryFrance
CityParis
Period7/10/189/10/18

Fingerprint

Dive into the research topics of 'Improved online algorithm for weighted flow time'. Together they form a unique fingerprint.

Cite this