Some complexity and approximation results for coupled-tasks scheduling problem according to topology.
Benoît DartiesRodolphe GiroudeauJean-Claude KönigGilles SimoninPublished in: RAIRO Oper. Res. (2016)
Keyphrases
- scheduling problem
- approximation error
- np hard
- single machine
- setup times
- worst case
- tabu search
- approximation algorithms
- total tardiness
- computational cost
- data mining
- flowshop
- error bounds
- minimizing makespan
- space complexity
- processing times
- multi task
- special case
- computational complexity
- optimal solution
- genetic algorithm