Online weighted flow time and deadline scheduling

In this paper we study some aspects of weighted flow time on parallel machines. We first showthat the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|ri, pmtn|ΣwiFi. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We showthat any c- competitive online algorithm for weighted flow time must also be c- competitive for Deadline Scheduling. We finally give an O(1)-competitive algorithm for Deadline Scheduling.

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

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

[3]  S. Muthukrishnan,et al.  Minimizing maximum response time in scheduling broadcasts , 2000, SODA '00.

[4]  Vincenzo Liberatore.  Scheduling Jobs before Shut-Down , 2000, Nord. J. Comput..

[5]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance [scheduling problems] , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[6]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[7]  Bala Kalyanasundaram,et al.  Scheduling Broadcasts in Wireless Networks , 2000, ESA.

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

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

[10]  Eugene L. Lawler,et al.  Preemptive scheduling of uniform machines subject to release dates : (preprint) , 1979 .

[11]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[12]  Krithi Ramamritham,et al.  Efficient concurrency control for broadcast environments , 1999, SIGMOD '99.

[13]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

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

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

[16]  S. Muthukrishnan,et al.  Scheduling on-demand broadcasts: new metrics and algorithms , 1998, MobiCom '98.

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

[18]  Michel X. Goemans,et al.  A Supermodular Relaxation for Scheduling with Release Dates , 1996, IPCO.

[19]  Luca Becchetti,et al.  Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines , 2001, STOC '01.

[20]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) , 1997, STOC.