1. TUHH Open Research (TORE)
  2. TUHH
  3. Publications without fulltext
DC FieldValueLanguage
dc.contributor.authorMnich, Matthias-
dc.contributor.authorvan Bevern, René-
dc.date.accessioned2020-01-28T09:23:09Z-
dc.date.available2020-01-28T09:23:09Z-
dc.date.issued2018-12-
dc.identifier.citationComputers (2018)de_DE
dc.identifier.issn0305-0548de_DE
dc.identifier.urihttp://hdl.handle.net/11420/4605-
dc.description.abstractMachine 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.isoende_DE
dc.relation.ispartofComputers & operations researchde_DE
dc.subjectMakespande_DE
dc.subjectNumber of tardy jobsde_DE
dc.subjectParallel machinesde_DE
dc.subjectShop schedulingde_DE
dc.subjectThroughputde_DE
dc.subjectTotal completion timede_DE
dc.subjectTotal tardinessde_DE
dc.subjectMathematics - Optimization and Controlde_DE
dc.subjectMathematics - Optimization and Controlde_DE
dc.subjectComputer Science - Computational Complexityde_DE
dc.subjectComputer Science - Data Structures and Algorithmsde_DE
dc.subject90B35de_DE
dc.subjectF.2.2; G.2.1de_DE
dc.titleParameterized complexity of machine scheduling: 15 open problemsde_DE
dc.typearticle-reviewde_DE
dc.type.dinireview-
dcterms.DCMITypeText-
tuhh.abstract.englishMachine 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.doi10.1016/j.cor.2018.07.020-
tuhh.type.opusReview (Artikel)-
dc.type.driverreview-
dc.type.casraiJournal Article-
tuhh.container.startpage254de_DE
tuhh.container.endpage261de_DE
dc.identifier.arxiv1709.01670v3de_DE
item.languageiso639-1en-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.creatorOrcidMnich, Matthias-
item.creatorOrcidvan Bevern, René-
item.creatorGNDMnich, Matthias-
item.creatorGNDvan Bevern, René-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypearticle-review-
item.grantfulltextnone-
crisitem.author.deptAlgorithmen und Komplexität E-11-
crisitem.author.orcid0000-0002-4721-5354-
crisitem.author.orcid0000-0002-4805-218X-
Appears in Collections:Publications without fulltext
Show simple item record

Page view(s)

103
Last Week
1
Last month
2
checked on Feb 28, 2021

Google ScholarTM

Check

Add Files to Item

Note about this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.