2 papers
cs.DS2026
Minimizing Makespan in Sublinear Time via Weighted Random Sampling
Bin Fu, Yumei Huo, Hairong Zhao
We consider the classical makespan minimization scheduling problem where jobs must be scheduled on identical machines. Using weighted random sampling, we developed two subl…
cs.DS2022
Streaming Algorithms for Multitasking Scheduling with Shared Processing
Bin Fu, Yumei Huo, Hairong Zhao
In this paper, we design the first streaming algorithms for the problem of multitasking scheduling on parallel machines with shared processing. In one pass, our streaming approxima…