Preprint
Sep 2026
Multidimensional Resource Scheduling with Small Demands
We study multidimensional resource scheduling. Each job $i$ has a $d$-dimensional resource-demand vector $v_i$ and a processing time $s_i$. The scheduler assigns a start time to each job, subject to the constraint that, at every time, the total demand of the jobs being processed does not exceed $1$ in any resource dime...
Y. Azar, Rathish Das, Hao Sun
· 0 citations