A parameterized complexity view on non-preemptively scheduling interval-constrained jobs › Research Explorer

Novosibirsk State University's Research Portal

A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack

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

DOI

https://doi.org/10.1007/s10951-016-0478-9
Final published version

René van Bevern
Rolf Niedermeier
Ondřej Suchý

Original language	English
Pages (from-to)	255-265
Number of pages	11
Journal	Journal of Scheduling
Volume	20
Issue number	3
DOIs	https://doi.org/10.1007/s10951-016-0478-9
Publication status	Published - 1 Jun 2017

Research areas

Fixed-parameter tractability, Machine minimization, NP-hard problem, Release times and deadlines, Sequencing within intervals, Shiftable intervals, NUMBER, MULTIVARIATE ALGORITHMICS

OECD FOS+WOS

2.11.IK ENGINEERING, MANUFACTURING
5.02.PE OPERATIONS RESEARCH & MANAGEMENT SCIENCE

ID: 9087777