Approximation Algorithms for Scheduling with Reservations.
Florian DiedrichKlaus JansenFanny PascualDenis TrystramPublished in: HiPC (2007)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- special case
- scheduling problem
- worst case
- vertex cover
- facility location problem
- minimum cost
- scheduling algorithm
- parallel processors
- randomized algorithms
- np hardness
- network design problem
- set cover
- open shop
- resource allocation
- approximation schemes
- primal dual
- lower bound
- approximation ratio
- release dates
- constant factor approximation
- disjoint paths
- constant factor
- setup times
- job shop scheduling
- job shop
- flowshop
- polynomial time approximation
- combinatorial auctions
- resource constraints