Parameterized complexity of a coupled-task scheduling problem.
Stéphane BessyRodolphe GiroudeauPublished in: J. Sched. (2019)
Keyphrases
- parameterized complexity
- scheduling problem
- np hard
- fixed parameter tractable
- flowshop
- global constraints
- tabu search
- special case
- np complete
- logic programs
- upper bound
- constraint satisfaction problems
- branch and bound algorithm
- approximation algorithms
- symmetry breaking
- bounded treewidth
- abstract argumentation
- database