Parameterized Complexity of a Parallel Machine Scheduling Problem.
Maher MallemClaire HanenAlix Munier KordonPublished in: IPEC (2022)
Keyphrases
- parameterized complexity
- parallel machine scheduling problem
- scheduling problem
- fixed parameter tractable
- parallel machines
- release dates
- total weighted tardiness
- np hard
- single machine
- global constraints
- sequence dependent setup times
- maximum lateness
- single machine scheduling problem
- symmetry breaking
- precedence constraints
- job shop scheduling problem
- processing times
- np complete
- tabu search
- computational problems
- integer programming
- flowshop