### Abstract

We consider parallel machine scheduling with job assignment restrictions, i.e., each job can only be processed on a certain subset of the machines. Moreover, each job requires a set of renewable resources. Any resource can be used by only one job at any time. The objective is to minimize the makespan. We present approximation algorithms with constant worst-case bound in the case that each job requires only a fixed number of resources. For some special cases optimal algorithms with polynomial running time are given. If any job requires at most one resource and the number of machines is fixed, we give a PTAS. On the other hand we prove that the problem is APX-hard, even when there are just three machines and the input is restricted to unit-time jobs.

Original language | English |
---|---|

Journal | Theoretical Computer Science |

DOIs | |

Publication status | Accepted/In press - Jan 1 2018 |

### Fingerprint

### Keywords

- APX hardness
- Graph coloring
- Resources
- Restricted assignment
- Scheduling

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Theoretical Computer Science*. https://doi.org/10.1016/j.tcs.2018.08.016