Approximation Algorithms for Scheduling with Reservations.
Florian DiedrichKlaus JansenFanny PascualDenis TrystramPublished in: Algorithmica (2010)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- scheduling problem
- special case
- worst case
- vertex cover
- facility location problem
- network design problem
- resource allocation
- undirected graph
- scheduling algorithm
- set cover
- np hardness
- minimum cost
- primal dual
- randomized algorithms
- resource constraints
- parallel processors
- constant factor approximation
- combinatorial auctions
- disjoint paths
- approximation schemes
- constant factor
- release dates
- sequence dependent setup times
- approximation ratio
- parallel machines
- production scheduling
- open shop
- genetic algorithm
- single machine scheduling problem