Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds

We consider the vector scheduling problem, a natural generalization of the classical makespan minimization problem to multiple resources. Here, we are given n jobs represented as d-dimensional vectors in [0,1] d and m identical machines, and the goal is to assign the jobs to machines such that the maximum load of each machine over all the coordinates is at most 1.

[1]  N. Alon,et al.  Approximation schemes for scheduling on parallel machines , 1998 .

[2]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[3]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[4]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[5]  David B. Shmoys,et al.  A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1988, SIAM J. Comput..

[6]  Tamir Tassa,et al.  Vector assignment schemes for asymmetric settings , 2005, Acta Informatica.

[7]  Tamir Tassa,et al.  Vector assignment problems: a general framework , 2002, J. Algorithms.

[8]  Adam Meyerson,et al.  Online Multidimensional Load Balancing , 2013, APPROX-RANDOM.

[9]  Klaus Jansen,et al.  An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables , 2009, SIAM J. Discret. Math..

[10]  Thomas Rothvoß,et al.  Approximating Bin Packing within O(log OPT * Log Log OPT) Bins , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[11]  Russell Impagliazzo,et al.  A duality between clause width and clause density for SAT , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[12]  Sanjeev Khanna,et al.  On Multidimensional Packing Problems , 2004, SIAM J. Comput..

[13]  Vincenzo Bonifaci,et al.  Scheduling Unrelated Machines of Few Different Types , 2012, ArXiv.

[14]  Ravi Kannan,et al.  Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..

[15]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[16]  Friedrich Eisenbrand,et al.  Carathéodory bounds for integer cones , 2006, Oper. Res. Lett..

[17]  András Frank,et al.  An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .