A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F17%3A00311742" target="_blank" >RIV/68407700:21240/17:00311742 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007%2Fs10951-016-0478-9" target="_blank" >https://link.springer.com/article/10.1007%2Fs10951-016-0478-9</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10951-016-0478-9" target="_blank" >10.1007/s10951-016-0478-9</a>
Alternative languages
Result language
angličtina
Original language name
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
Original language description
We study the problem of non-preemptively scheduling n jobs, each job j with a release time , a deadline , and a processing time , on m parallel identical machines. Cieliebak et al. (2004) considered the two constraints and and showed the problem to be NP-hard for any and for any . We complement their results by parameterized complexity studies: we show that, for any , the problem remains weakly NP-hard even for and strongly W[1]-hard parameterized by m. We present a pseudo-polynomial-time algorithm for constant m and and a fixed-parameter tractability result for the parameter m combined with sigma.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GP14-13017P" target="_blank" >GP14-13017P: Parameterized Algorithms for Fundamental Network Problems Related to Connectivity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Scheduling
ISSN
1094-6136
e-ISSN
1099-1425
Volume of the periodical
20
Issue of the periodical within the volume
3
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
11
Pages from-to
255-265
UT code for WoS article
000400364500003
EID of the result in the Scopus database
2-s2.0-84963995311