On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
From MaRDI portal
Publication:6089672
Recommendations
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
- Scheduling and fixed-parameter tractability
- Scheduling and fixed-parameter tractability
- On the parametric complexity of schedules to minimize tardy tasks.
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A note on combined job selection and sequencing problems
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Can you beat treewidth?
- Color-coding
- Fourier meets M\"{o}bius: fast subset convolution
- On the parametric complexity of schedules to minimize tardy tasks.
- Open Problems in Throughput Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parameterized algorithms
- Parameterized complexity of a coupled-task scheduling problem
- Parameterized complexity of machine scheduling: 15 open problems
- Precedence scheduling with unit execution time is equivalent to parametrized biclique
- Scheduling
- Scheduling and fixed-parameter tractability
- Scheduling partially ordered jobs faster than \(2^n\)
- Scheduling with Outliers
- The design of approximation algorithms
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
Cited in
(3)
This page was built for publication: On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089672)
