Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling

Rathish Das, Hao Sun

We study the precedence-constrained resource scheduling problem [SICOMP'75]. There are $n$ jobs where each job takes a certain time to finish and has a resource requirement through…