Inapproximability Results for Scheduling with Interval and Resource Restrictions

Marten Maack & Klaus Jansen
In the restricted assignment problem, the input consists of a set of machines and a set of jobs each with a processing time and a subset of eligible machines. The goal is to find an assignment of the jobs to the machines minimizing the makespan, that is, the maximum summed up processing time any machine receives. Herein, jobs should only be assigned to those machines on which they are eligible. It is well-known that there...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.