Parameterized complexity of machine scheduling

Standard

Parameterized complexity of machine scheduling : 15 open problems. / Mnich, Matthias; van Bevern, René.

In: Computers and Operations Research, Vol. 100, 01.12.2018, p. 254-261.

Research output: Contribution to journal › Review article › peer-review

Harvard

Mnich, M & van Bevern, R 2018, 'Parameterized complexity of machine scheduling: 15 open problems', Computers and Operations Research, vol. 100, pp. 254-261. https://doi.org/10.1016/j.cor.2018.07.020

APA

Mnich, M., & van Bevern, R. (2018). Parameterized complexity of machine scheduling: 15 open problems. Computers and Operations Research, 100, 254-261. https://doi.org/10.1016/j.cor.2018.07.020

Vancouver

Mnich M, van Bevern R. Parameterized complexity of machine scheduling: 15 open problems. Computers and Operations Research. 2018 Dec 1;100:254-261. doi: 10.1016/j.cor.2018.07.020

Author

Mnich, Matthias ; van Bevern, René. / Parameterized complexity of machine scheduling : 15 open problems. In: Computers and Operations Research. 2018 ; Vol. 100. pp. 254-261.

BibTeX

@article{4d51c6591caf496f8915c391cb6707bf,

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

author = "Matthias Mnich and {van Bevern}, Ren{\'e}",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier Ltd",

year = "2018",

month = dec,

day = "1",

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

language = "English",

volume = "100",

pages = "254--261",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - Parameterized complexity of machine scheduling

T2 - 15 open problems

AU - Mnich, Matthias

AU - van Bevern, René

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 - Makespan

KW - Number of tardy jobs

KW - Parallel machines

KW - Shop scheduling

KW - Throughput

KW - Total completion time

KW - Total tardiness

KW - MULTIVARIATE ALGORITHMICS

KW - WEIGHTED NUMBER

KW - TASKS

KW - MAKESPAN MINIMIZATION

KW - OPEN SHOPS

KW - LATE JOBS

KW - MEAN FLOW TIME

KW - FORBIDDEN START

UR - http://www.scopus.com/inward/record.url?scp=85051547881&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2018.07.020

DO - 10.1016/j.cor.2018.07.020

M3 - Review article

AN - SCOPUS:85051547881

VL - 100

SP - 254

EP - 261

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

ER -

ID: 16083112