A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing

Abstract

We consider the Vector Scheduling problem on identical machines: we have m machines, and a set J of n jobs, where each job j has a processing-time vector pj ∈ R d ≥0. The goal is to find an assignment σ : J → [m] of jobs to machines so as to minimize the makespanmaxi∈[m] maxr∈[d] ( ∑