Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-uniform Distributions

In this paper we consider the classic scheduling problem of minimizing total weighted completion time on unrelated machines when jobs have release times, i.e, R|rij| Σj wjCj using the three-field notation. For this problem, a 2-approximation is known based on a novel convex programming (J. ACM 2001 by Skutella). It has been a long standing open problem if one can improve upon this 2-approximation (Open Problem 8 in J. of Sched. 1999 by Schuurman and Woeginger). We answer this question in the affirmative by giving a 1.8786-approximation. We achieve this via a surprisingly simple linear programming, but a novel rounding algorithm and analysis. A key ingredient of our algorithm is the use of random offsets sampled from non-uniform distributions. We also consider the preemptive version of the problem, i.e, R|rij, pmtn|ΣjwjCj. We again use the idea of sampling offsets from non-uniform distributions to give the first better than 2-approximation for this problem. This improvement also requires use of a configuration LP with variables for each job's complete schedules along with more careful analysis. For both non-preemptive and preemptive versions, we break the approximation barrier of 2 for the first time.

[1]  Ola Svensson,et al.  Santa Claus schedules jobs on unrelated machines , 2010, STOC '11.

[2]  Han Hoogeveen,et al.  Non-Approximability Results for Scheduling Problems with Minsum Criteria , 1998, INFORMS J. Comput..

[3]  Amin Saberi,et al.  An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods , 2010, SIAM J. Comput..

[4]  Rajkumar Buyya,et al.  Energy Efficient Allocation of Virtual Machines in Cloud Data Centers , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[5]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[6]  Maxim Sviridenko,et al.  Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines , 2013, IPCO.

[7]  Sanjeev Khanna,et al.  A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines , 2001, ICALP.

[8]  Aravind Srinivasan,et al.  Lift-and-round to improve weighted completion time on unrelated machines , 2015, STOC.

[9]  Gerhard J. Woeginger,et al.  A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines , 2000, Math. Oper. Res..

[10]  Martin Skutella,et al.  Scheduling Unrelated Machines by Randomized Rounding , 2002, SIAM J. Discret. Math..

[11]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[12]  Janardhan Kulkarni,et al.  Minimizing Flow-Time on Unrelated Machines , 2014, STOC.

[13]  Nikhil Bansal,et al.  The Santa Claus problem , 2006, STOC '06.

[14]  V. N. Muralidhara,et al.  Minimizing Total Flow-Time: The Unrelated Case , 2008, ISAAC.

[15]  Aravind Srinivasan,et al.  New Constructive Aspects of the Lovasz Local Lemma , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

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

[17]  Uriel Feige,et al.  Santa Claus Meets Hypergraph Matchings , 2008, APPROX-RANDOM.

[18]  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).

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

[20]  Gerhard J. Woeginger,et al.  Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .

[21]  Sanjeev Khanna,et al.  Approximation Algorithms for Minimizing AverageWeighted Completion Time , 2004, Handbook of Scheduling.

[22]  Cynthia A. Phillips,et al.  Task Scheduling in Networks , 1997, SIAM J. Discret. Math..

[23]  Uriel Feige,et al.  On allocations that maximize fairness , 2008, SODA '08.

[24]  Aravind Srinivasan,et al.  A unified approach to scheduling on unrelated parallel machines , 2009, JACM.

[25]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[26]  Jirí Sgall,et al.  Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines , 2008, Algorithmica.

[27]  Ayan Banerjee,et al.  Spatio-temporal thermal-aware job scheduling to minimize energy consumption in virtualized heterogeneous data centers , 2009, Comput. Networks.

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

[29]  Barnaby Martin,et al.  Parameterized Proof Complexity , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[30]  Mark S. Squillante,et al.  Optimal scheduling of multiclass parallel machines , 1999, SODA '99.

[31]  Martin Skutella,et al.  Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.

[32]  Sanjeev Khanna,et al.  On Allocating Goods to Maximize Fairness , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[33]  Amit Kumar,et al.  Minimizing Average Flow-time : Upper and Lower Bounds , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

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

[35]  Yossi Azar,et al.  Convex programming for scheduling unrelated parallel machines , 2005, STOC '05.

[36]  Aravind Srinivasan,et al.  Minimum Weighted Completion Time , 2008, Encyclopedia of Algorithms.

[37]  Mark S. Squillante,et al.  Failure data analysis of a large-scale heterogeneous server environment , 2004, International Conference on Dependable Systems and Networks, 2004.