A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435): Difference between revisions

Latest revision as of 09:00, 14 July 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

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

0 references

Journal of Scheduling

0 references

publication date

1 September 2017

0 references

full work available at URL

https://arxiv.org/abs/1508.01657

0 references

zbMATH Keywords

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

MaRDI profile type

MaRDI publication profile

0 references

cites work

Towards optimal and expressive kernelization for \(d\)-hitting set

0 references

Approximability and parameterized complexity of multicover by \(c\)-intervals

0 references

Interval scheduling and colorful independent sets

0 references

\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling

0 references

An <i>ℴ</i>(log <i>m</i>)-Competitive Algorithm for Online Machine Minimization

0 references

Q4673408

0 references

Parameterized Algorithms

0 references

Fundamentals of parameterized complexity

0 references

Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity

0 references

On the parametric complexity of schedules to minimize tardy tasks.

0 references

Parametrized complexity theory.

0 references

Q4198056

0 references

Strip Graphs: Recognition and Scheduling

0 references

Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs

0 references

Bin packing with fixed number of bins revisited

0 references

Interval scheduling: A survey

0 references

A complete 4-parametric complexity classification of short shop scheduling problems

0 references

Shiftable intervals

0 references

Scheduling and fixed-parameter tractability

0 references

Reflections on Multivariate Algorithmics and Problem Parameterization

0 references

Q5710169

0 references

Q2963933

0 references

An introduction to multi-parameter complexity analysis of discrete problems

0 references

Identifiers

zbMATH Open document ID

1376.90028

0 references

DOI

10.1007/s10951-016-0478-9

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2400435

@@ Property / cites work @@
+Towards optimal and expressive kernelization for \(d\)-hitting set
+Normal rank
@@ Property / cites work @@
+Approximability and parameterized complexity of multicover by \(c\)-intervals
+Normal rank
@@ Property / cites work @@
+Interval scheduling and colorful independent sets
@@ Property / cites work: Interval scheduling and colorful independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
+Normal rank
@@ Property / cites work @@
+An <i>ℴ</i>(log <i>m</i>)-Competitive Algorithm for Online Machine Minimization
+Normal rank
@@ Property / cites work @@
+Q4673408
@@ Property / cites work: Q4673408 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
+Normal rank
@@ Property / cites work @@
+On the parametric complexity of schedules to minimize tardy tasks.
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Strip Graphs: Recognition and Scheduling
@@ Property / cites work: Strip Graphs: Recognition and Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs
+Normal rank
@@ Property / cites work @@
+Bin packing with fixed number of bins revisited
@@ Property / cites work: Bin packing with fixed number of bins revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Interval scheduling: A survey
@@ Property / cites work: Interval scheduling: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+A complete 4-parametric complexity classification of short shop scheduling problems
+Normal rank
@@ Property / cites work @@
+Shiftable intervals
@@ Property / cites work: Shiftable intervals / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling and fixed-parameter tractability
@@ Property / cites work: Scheduling and fixed-parameter tractability / rank @@
+Normal rank
@@ Property / cites work @@
+Reflections on Multivariate Algorithmics and Problem Parameterization
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2963933
@@ Property / cites work: Q2963933 / rank @@
+Normal rank
@@ Property / cites work @@
+An introduction to multi-parameter complexity analysis of discrete problems
+Normal rank