|Publisher DOI:||10.1016/j.cor.2018.07.020||arXiv ID:||1709.01670v3||Title:||Parameterized complexity of machine scheduling: 15 open problems||Language:||English||Authors:||Mnich, Matthias
van Bevern, René
|Keywords:||Makespan;Number of tardy jobs;Parallel machines;Shop scheduling;Throughput;Total completion time;Total tardiness;Mathematics - Optimization and Control;Mathematics - Optimization and Control;Computer Science - Computational Complexity;Computer Science - Data Structures and Algorithms;90B35;F.2.2; G.2.1||Issue Date:||Dec-2018||Source:||Computers (2018)||Journal or Series Name:||Computers & operations research||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.
|URI:||http://hdl.handle.net/11420/4605||ISSN:||0305-0548||Document Type:||Review (Article)|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on Jan 25, 2021
Add Files to Item
Note about this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.