A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10951-016-0478-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10951-016-0478-9 / rank | |||
Normal rank | |||
Latest revision as of 09:59, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack |
scientific article |
Statements
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (English)
0 references
1 September 2017
0 references
release times and deadlines
0 references
machine minimization
0 references
sequencing within intervals
0 references
shiftable intervals
0 references
fixed-parameter tractability
0 references
NP-hard problem
0 references
0 references
