Approximation Algorithms for Scheduling with Resource and Precedence Constraints.
Gökalp DemirciHenry HoffmannDavid H. K. KimPublished in: STACS (2018)
Keyphrases
- precedence constraints
- approximation algorithms
- precedence relations
- vertex cover
- release dates
- np hard
- special case
- parallel processors
- sequence dependent setup times
- maximum lateness
- single machine scheduling problem
- worst case
- resource allocation
- minimum cost
- setup times
- scheduling problem
- resource constraints
- unit length
- greedy algorithm
- undirected graph
- np complete
- polynomial time approximation