Structural Parameters for Scheduling with Assignment Restrictions

Jansen, Klaus, Maack, Marten and Solis-Oba, Roberto (2017) Structural Parameters for Scheduling with Assignment Restrictions Algorithms and Complexity. Springer, Cham, pp. 357-368. DOI 10.1007/978-3-319-57586-5_30.

Full text not available from this repository.

Supplementary data:


We consider scheduling on identical and unrelated parallel machines with job assignment restrictions. These problems are NP-hard and they do not admit polynomial time approximation algorithms with approximation ratios smaller than 1.5 unless P = NP. However, if we impose limitations on the set of machines that can process a job, the problem sometimes becomes easier in the sense that algorithms with approximation ratios better than 1.5 exist. We introduce three graphs, based on the assignment restrictions and study the computational complexity of the scheduling problem with respect to structural properties of these graphs, in particular their tree- and rankwidth. We identify cases that admit polynomial time approximation schemes or FPT algorithms, generalizing and extending previous results in this area.

This work was partially supported by the DAAD (Deutscher Akademischer Austauschdienst) and by the German Research Foundation (DFG) project JA 612/15-1.

Document Type: Book chapter
Research affiliation: Kiel University
Kiel University > Kiel Marine Science
OceanRep > The Future Ocean - Cluster of Excellence
Refereed: Yes
DOI etc.: 10.1007/978-3-319-57586-5_30
ISSN: 0302-9743
Date Deposited: 19 Dec 2017 10:49
Last Modified: 19 Dec 2017 10:49

Actions (login required)

View Item View Item