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
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:01, 2 February 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
