Parameterized complexity of machine scheduling: 15 open problems

09/06/2017

∙

by   Matthias Mnich, et al.

∙

0

∙

share

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 interesting open questions in this area.