Approximation Algorithms for Scheduling with Class Constraints.
Klaus JansenAlexandra LassotaMarten MaackPublished in: CoRR (2019)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- special case
- worst case
- resource constraints
- scheduling problem
- vertex cover
- minimum cost
- constant factor
- approximation ratio
- primal dual
- np hardness
- open shop
- randomized algorithms
- facility location problem
- network design problem
- set cover
- sequence dependent setup times
- approximation schemes
- linear constraints
- global constraints
- disjoint paths
- learning algorithm
- job shop
- constant factor approximation