Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete (Q6835784)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8179332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete |
scientific article; zbMATH DE number 8179332 |
Statements
Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete (English)
0 references
30 March 2026
0 references
parameterized complexity
0 references
scheduling
0 references
single machine
0 references
coupled tasks
0 references
precedence delays
0 references
0 references
0 references
0 references
