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 ... ...

请注册登录后继续浏览