Parameterized complexity of machine scheduling: 15 open problems
Research output: Contribution to journal › Article › Academic › peer-review
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. (C) 2018 Elsevier Ltd. All rights reserved.
- Parallel machines, Shop scheduling, Makespan, Total completion time, Total tardiness, Throughput, Number of tardy jobs, TIME APPROXIMATION SCHEME, MEAN FLOW TIME, OPEN-SHOPS, LATE JOBS, MAKESPAN MINIMIZATION, WEIGHTED NUMBER, FORBIDDEN START, MULTIVARIATE ALGORITHMICS, PARALLEL MACHINES, COMPLETION TIMES, TASKS, OPEN SHOPS