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. (C) 2018 Elsevier Ltd. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 254-261 |
| Number of pages | 8 |
| Journal | Computers and Operations Research |
| Volume | 100 |
| DOIs | |
| Publication status | Published - 1 Dec 2018 |
Keywords
- Makespan
- Number of tardy jobs
- Parallel machines
- Shop scheduling
- Throughput
- Total completion time
- Total tardiness
- MULTIVARIATE ALGORITHMICS
- WEIGHTED NUMBER
- TASKS
- MAKESPAN MINIMIZATION
- OPEN SHOPS
- LATE JOBS
- MEAN FLOW TIME
- FORBIDDEN START
OECD FOS+WOS
- 1.02.EV COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
- 2.11.IJ ENGINEERING, INDUSTRIAL
- 5.02.PE OPERATIONS RESEARCH & MANAGEMENT SCIENCE