Parameterized complexity of machine scheduling

Original language	English
Pages (from-to)	254-261
Number of pages	8
Journal	Computers and Operations Research
Volume	100
DOIs	https://doi.org/10.1016/j.cor.2018.07.020
Publication status	Published - 1 Dec 2018

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

ID: 16083112

Parameterized complexity of machine scheduling: 15 open problems