WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines

We consider the classical online scheduling problem over single and parallel machines with the objective of minimizing total weighted flow time. We employ an intuitive and systematic analysis method and show that the weighted shortest processing time (WSPT) is an optimal online algorithm with the competitive ratio of for the case of single machine, and it is ()-competitive for the case of parallel machines , where P is the ratio of the longest to the shortest processing time.

[1]  Han Hoogeveen,et al.  Optimal On-Line Algorithms for Single-Machine Scheduling , 1996, IPCO.

[2]  Yugeng Xi,et al.  A SEMI-ONLINE ALGORITHM AND ITS COMPETITIVE ANALYSIS FOR A SINGLE MACHINE SCHEDULING PROBLEM WITH BOUNDED PROCESSING TIMES , 2010 .

[3]  Stefano Leonardi,et al.  A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines , 2006, Efficient Approximation and Online Algorithms.

[4]  Leen Stougie,et al.  A class of on-line scheduling algorithms to minimize total completion time , 2003, Oper. Res. Lett..

[5]  Ye Tao,et al.  An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time , 2010, Inf. Process. Lett..

[6]  David P. Bunde.  SPT is optimally competitive for uniprocessor flow , 2004, Inf. Process. Lett..

[7]  José R. Correa,et al.  LP-based online scheduling: from single to parallel machines , 2005, Math. Program..

[8]  Chris N. Potts,et al.  On-line scheduling of a single machine to minimize total weighted completion time , 2002, SODA '02.

[9]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[10]  Gerhard J. Woeginger,et al.  Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine , 1999, SIAM J. Comput..

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

[12]  David Simchi-Levi,et al.  The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates , 2001, Math. Program..

[13]  Nikhil Bansal,et al.  Minimizing weighted flow time , 2007, ACM Trans. Algorithms.

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

[15]  Martin Skutella,et al.  Single Machine Scheduling with Release Dates , 2002, SIAM J. Discret. Math..

[16]  Cynthia A. Phillips,et al.  Minimizing average completion time in the presence of release dates , 1998, Math. Program..

[17]  Xi Yugeng.  A NOVEL WAY TO ANALYZE COMPETITIVE PERFORMANCE OF ONLINE ALGORITHMS——INSTANCE TRANSFORMATION BASED METHOD , 2009 .