Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete
From MaRDI portal
Cites work
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
- A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints
- Coupled task scheduling with exact delays: literature review and models
- Deterministic Scheduling with Pipelined Processors
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 900396 (Why is no real title available?)
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- On the complexity of coupled-task scheduling
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parameterized complexity of a coupled-task scheduling problem
- Parameterized complexity of a parallel machine scheduling problem
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
- Preemptive Scheduling with Release Times, Deadlines, and Due Times
- Scheduling and fixed-parameter tractability
- Scheduling coupled tasks with exact delays for minimum total job completion time
- Single-machine scheduling with release times, deadlines, setup times, and rejection
This page was built for publication: Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6835784)
