Parameterized complexity of a parallel machine scheduling problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1114020 (Why is no real title available?)
- scientific article; zbMATH DE number 7764095 (Why is no real title available?)
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
- Complexity of Scheduling under Precedence Constraints
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- NP-complete scheduling problems
- On the complexity of coupled-task scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parameterized complexity of a coupled-task scheduling problem
- Parameterized complexity of machine scheduling: 15 open problems
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
- Reducibility among combinatorial problems
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- Scheduling Opposing Forests
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
Cited in
(3)
This page was built for publication: Parameterized complexity of a parallel machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968991)
