Parameterized complexity of a coupled-task scheduling problem
S. Bessy, R. Giroudeau
| Year of publication: |
2019
|
|---|---|
| Authors: | Bessy, S. ; Giroudeau, R. |
| Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 22.2019, 3, p. 305-313
|
| Subject: | Coupled-task scheduling model | FPT algorithms | W[1]-hardness | Kernel lower bound | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1007/s10951-018-0581-1 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012056522