Parameterized complexity of machine scheduling: 15 open problems

Matthias Mnich; Rene van Bevern

doi:10.1016/j.cor.2018.07.020

Parameterized complexity of machine scheduling: 15 open problems

Matthias Mnich, Rene van Bevern^*

^*Corresponding author for this work

QE Operations research

Research output: Contribution to journal › Article › Academic › peer-review

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 & Operations Research
Volume	100
DOIs	https://doi.org/10.1016/j.cor.2018.07.020
Publication status	Published - 1 Dec 2018

Keywords

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

Access to Document

10.1016/j.cor.2018.07.020

Cite this

@article{64d278e69e4e45b085b18d600436477b,

title = "Parameterized complexity of machine scheduling: 15 open problems",

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.",

keywords = "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",

author = "Matthias Mnich and {van Bevern}, Rene",

note = "data source: no data used",

year = "2018",

month = dec,

day = "1",

doi = "10.1016/j.cor.2018.07.020",

language = "English",

volume = "100",

pages = "254--261",

journal = "Computers & Operations Research",

issn = "0305-0548",

publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Parameterized complexity of machine scheduling: 15 open problems

AU - Mnich, Matthias

AU - van Bevern, Rene

N1 - data source: no data used

PY - 2018/12/1

Y1 - 2018/12/1

N2 - 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.

AB - 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.

KW - Parallel machines

KW - Shop scheduling

KW - Makespan

KW - Total completion time

KW - Total tardiness

KW - Throughput

KW - Number of tardy jobs

KW - TIME APPROXIMATION SCHEME

KW - MEAN FLOW TIME

KW - OPEN-SHOPS

KW - LATE JOBS

KW - MAKESPAN MINIMIZATION

KW - WEIGHTED NUMBER

KW - FORBIDDEN START

KW - MULTIVARIATE ALGORITHMICS

KW - PARALLEL MACHINES

KW - COMPLETION TIMES

KW - TASKS

KW - OPEN SHOPS

U2 - 10.1016/j.cor.2018.07.020

DO - 10.1016/j.cor.2018.07.020

M3 - Article

SN - 0305-0548

VL - 100

SP - 254

EP - 261

JO - Computers & Operations Research

JF - Computers & Operations Research

ER -

Parameterized complexity of machine scheduling: 15 open problems

Abstract

Keywords

Access to Document

Fingerprint

Cite this