DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mnich, Matthias | - |
dc.contributor.author | van Bevern, René | - |
dc.date.accessioned | 2020-01-28T09:23:09Z | - |
dc.date.available | 2020-01-28T09:23:09Z | - |
dc.date.issued | 2018-12 | - |
dc.identifier.citation | Computers (2018) | de_DE |
dc.identifier.issn | 0305-0548 | de_DE |
dc.identifier.uri | http://hdl.handle.net/11420/4605 | - |
dc.description.abstract | Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open questions in this area whose resolution we expect to lead to the discovery of new approaches and techniques both in scheduling and parameterized complexity theory. | en |
dc.language.iso | en | de_DE |
dc.relation.ispartof | Computers & operations research | de_DE |
dc.subject | Makespan | de_DE |
dc.subject | Number of tardy jobs | de_DE |
dc.subject | Parallel machines | de_DE |
dc.subject | Shop scheduling | de_DE |
dc.subject | Throughput | de_DE |
dc.subject | Total completion time | de_DE |
dc.subject | Total tardiness | de_DE |
dc.subject | Mathematics - Optimization and Control | de_DE |
dc.subject | Mathematics - Optimization and Control | de_DE |
dc.subject | Computer Science - Computational Complexity | de_DE |
dc.subject | Computer Science - Data Structures and Algorithms | de_DE |
dc.subject | 90B35 | de_DE |
dc.subject | F.2.2; G.2.1 | de_DE |
dc.title | Parameterized complexity of machine scheduling: 15 open problems | de_DE |
dc.type | article-review | de_DE |
dc.type.dini | review | - |
dcterms.DCMIType | Text | - |
tuhh.abstract.english | Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open questions in this area whose resolution we expect to lead to the discovery of new approaches and techniques both in scheduling and parameterized complexity theory. | de_DE |
tuhh.publisher.doi | 10.1016/j.cor.2018.07.020 | - |
tuhh.type.opus | Review (Artikel) | - |
dc.type.driver | review | - |
dc.type.casrai | Journal Article | - |
tuhh.container.startpage | 254 | de_DE |
tuhh.container.endpage | 261 | de_DE |
dc.identifier.arxiv | 1709.01670v3 | de_DE |
item.languageiso639-1 | en | - |
item.fulltext | No Fulltext | - |
item.cerifentitytype | Publications | - |
item.creatorOrcid | Mnich, Matthias | - |
item.creatorOrcid | van Bevern, René | - |
item.creatorGND | Mnich, Matthias | - |
item.creatorGND | van Bevern, René | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | article-review | - |
item.grantfulltext | none | - |
crisitem.author.dept | Algorithmen und Komplexität E-11 | - |
crisitem.author.orcid | 0000-0002-4721-5354 | - |
crisitem.author.orcid | 0000-0002-4805-218X | - |
Appears in Collections: | Publications without fulltext |
Add Files to Item
Note about this record
Export
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.