2 papers
cs.DS2023
Sublinear Approximation Schemes for Scheduling Precedence Graphs of Bounded Depth
Bin Fu, Yumei Huo, Hairong Zhao
We study the classical scheduling problem on parallel machines %with precedence constraints where the precedence graph has the bounded depth . Our goal is to minimize the maximu…
cs.DS2022
Streaming Approximation Scheme for Minimizing Total Completion Time on Parallel Machines Subject to Varying Processing Capacity
Bin Fu, Yumei Huo, Hairong Zhao
We study the problem of minimizing total completion time on parallel machines subject to varying processing capacity. In this paper, we develop an approximation scheme for the prob…