Non-uniform Geometric Set Cover and Scheduling on Multiple Machines
Non-uniform Geometric Set Cover and Scheduling on Multiple Machines
We consider the following general scheduling problem studied recently by Moseley [27]. There are n jobs, all released at time 0, where job j has size pj and an associated arbitrary non-decreasing cost function fj of its completion time. The goal is to find a schedule on m machines with …