Parameterized complexity of a coupled-task scheduling problem
From MaRDI portal
Recommendations
- Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology
- Coupled-tasks in presence of bipartite compatibilities graphs
- On the parametric complexity of schedules to minimize tardy tasks.
- Scheduling of coupled tasks with unit processing times
Cites work
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
- Approximating coupled-task scheduling problems with equal exact delays
- Color-coding
- Combinatorial \(n\)-fold integer programming and applications
- Coupled-tasks in presence of bipartite compatibilities graphs
- Cross-composition: a new technique for kernelization lower bounds
- Fundamentals of parameterized complexity
- Handbook on Scheduling
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302193 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Identical coupled task scheduling: polynomial complexity of the cyclic case
- New algorithms for coupled tasks scheduling - a survey
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- On the complexity of coupled-task scheduling
- On the parameterized complexity of short computation and factorization
- On the parameterized tractability of the just-in-time flow-shop scheduling problem
- On the parametric complexity of schedules to minimize tardy tasks.
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parameterized complexity of machine scheduling: 15 open problems
- Parametrized complexity theory.
- Partition refinement techniques: an interesting algorithmic tool kit
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
- Scheduling and fixed-parameter tractability
- Scheduling coupled tasks
- Scheduling meets n-fold integer programming
- The Spatial Complexity of Oblivious k-Probe Hash Functions
- Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph
Cited in
(22)- On the parametric complexity of schedules to minimize tardy tasks.
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
- Scheduling coupled tasks with exact delays for minimum total job completion time
- Coupled task scheduling with time-dependent processing times
- Moderate exponential-time algorithms for scheduling problems
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
- Coupled task scheduling with exact delays: literature review and models
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
- A note on scheduling coupled tasks for minimum total completion time
- Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph
- Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks
- A branch-and-bound algorithm for the coupled task problem
- scientific article; zbMATH DE number 7764095 (Why is no real title available?)
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
- Approximation algorithms for coupled task scheduling minimizing the sum of completion times
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
- Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete
- Parameterized complexity of a parallel machine scheduling problem
- Moderate exponential-time algorithms for scheduling problems
- Single machine scheduling with precedence constraints and bounded maximum delay value
- Scheduling and fixed-parameter tractability
This page was built for publication: Parameterized complexity of a coupled-task scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283295)
