Approximation Algorithms for Time Constrained Scheduling.
Klaus JansenSabine R. ÖhringPublished in: IRREGULAR (1995)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- scheduling problem
- worst case
- special case
- vertex cover
- minimum cost
- scheduling algorithm
- facility location problem
- network design problem
- set cover
- open shop
- primal dual
- approximation ratio
- resource allocation
- real time database systems
- parallel machines
- constant factor
- approximation schemes
- disjoint paths
- np hardness
- objective function
- constant factor approximation