Parameterized complexity of machine scheduling: 15 open problems

TL;DR

This paper presents 15 open problems in the parameterized complexity of machine scheduling, aiming to inspire new research and techniques in both scheduling algorithms and complexity theory.

Contribution

It introduces a set of open questions in fixed-parameter algorithms for machine scheduling, fostering future research in the field.

Findings

Proposes 15 open problems in machine scheduling complexity

Encourages development of new algorithms and techniques

Bridges scheduling and parameterized complexity research

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.