Mnich, MatthiasMatthiasMnichvan Bevern, RenéRenévan Bevern2020-01-282020-01-282018-12Computers (2018)http://hdl.handle.net/11420/4605Machine 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.en0305-05482018254261MakespanNumber of tardy jobsParallel machinesShop schedulingThroughputTotal completion timeTotal tardinessMathematics - Optimization and ControlMathematics - Optimization and ControlComputer Science - Computational ComplexityComputer Science - Data Structures and Algorithms90B35F.2.2; G.2.1Review Article10.1016/j.cor.2018.07.0201709.01670v3Other