Minimizing weighted flow time

We consider the problem of minimizing weighted flow time on a single machine in the preemptive setting. Our main result is an O(log W) competitive online algorithm where the maximum to the minimum ratio of weights is W. More generally our algorithm achieves a competitive ratio of k if there are k weight classes. This gives the first O(1)-competitive algorithm for constant k. No O(1) competitive algorithm was known previously even for the special case of k = 2. These results settle a question posed by Chekuri et al [5] about the existence of a "truly" online algorithm with a non-trivial competitive ratio. We also give a "semi-online" algorithm with competitive ratio O(log n + log P), where P is ratio of the maximum to minimum job size. Our second result deals with the non-clairvoyant setting where the job sizes are unknown (but the weight of the jobs are known). We consider the resource augmentation model, and give a non-clairvoyant online algorithm, which if allowed a (1 + ε) speed-up, is (1 + l/ε) competitive against an optimal offline, clairvoyant algorithm.

[1]  Rajmohan Rajaraman,et al.  Improved algorithms for stretch scheduling , 2002, SODA '02.

[2]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) , 1997, Symposium on the Theory of Computing.

[3]  Luca Becchetti,et al.  Scheduling to minimize average stretch without migration , 2000, SODA '00.

[4]  Sanjeev Khanna,et al.  Algorithms for minimizing weighted flow time , 2001, STOC '01.

[5]  Amitabh Sinha,et al.  Non-Clairvoyant Scheduling for Minimizing Mean Slowdown , 2003, Algorithmica.

[6]  Kirk Pruhs,et al.  Server scheduling in the Lp norm: a rising tide lifts all boat , 2003, STOC '03.

[7]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

[8]  Stefano Leonardi,et al.  Approximating total flow time on parallel machines , 1997, STOC '97.

[9]  Nikhil Bansal.  Minimizing flow time on a constant number of machines with preemption , 2005, Oper. Res. Lett..

[10]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[11]  Rajeev Motwani,et al.  Approximation techniques for average completion time scheduling , 1997, SODA '97.

[12]  Ashish Goel,et al.  Multi-processor scheduling to minimize flow time with ε resource augmentation , 2004, STOC '04.

[13]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[14]  Michael A. Bender,et al.  Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.

[15]  Yossi Azar,et al.  Minimizing the flow time without migration , 1999, STOC '99.

[16]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[17]  Kirk Pruhs,et al.  Online weighted flow time and deadline scheduling , 2001, J. Discrete Algorithms.

[18]  Kirk Pruhs,et al.  Online scheduling , 2003 .

[19]  Yossi Azar,et al.  Minimizing total flow time and total completion time with immediate dispatching , 2003, SPAA.

[20]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[21]  Luca Becchetti,et al.  Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines , 2004, JACM.

[22]  Sandy Irani,et al.  Randomized Weighted Caching with Two Page Weights , 2002, Algorithmica.

[23]  Sanjeev Khanna,et al.  Approximation schemes for preemptive weighted flow time , 2002, STOC '02.

[24]  Piotr Berman,et al.  Speed is More Powerful than Clairvoyance , 1998, Nord. J. Comput..

[25]  David B. Shmoys,et al.  Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.

[26]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[27]  Gerhard J. Woeginger,et al.  Approximability and nonapproximability results for minimizing total flow time on a single machine , 1996, STOC '96.

[28]  Bala Kalyanasundaram,et al.  Minimizing flow time nonclairvoyantly , 2003, JACM.

[29]  Rajmohan Rajaraman,et al.  Online scheduling to minimize average stretch , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[30]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[31]  Kirk Pruhs,et al.  Server Scheduling in the Weighted lp Norm , 2004, LATIN.