Tight approximation algorithms for scheduling with fixed jobs and nonavailability.
Florian DiedrichKlaus JansenLars PrädelUlrich M. SchwarzOla SvenssonPublished in: ACM Trans. Algorithms (2012)
Keyphrases
- approximation algorithms
- precedence constraints
- worst case
- open shop
- identical parallel machines
- strongly np hard
- np hard
- unrelated parallel machines
- release dates
- scheduling problem
- lower bound
- identical machines
- fixed number
- vertex cover
- special case
- parallel machines
- upper bound
- sequence dependent setup times
- processing times
- polynomial time approximation
- job shop
- flowshop
- minimum cost
- facility location problem
- single machine scheduling problem
- setup times
- scheduling algorithm
- branch and bound algorithm
- wafer fabrication
- approximation ratio
- set cover
- job scheduling
- scheduling strategy
- deteriorating jobs
- constant factor
- single machine
- undirected graph
- approximation schemes
- primal dual
- combinatorial auctions
- computational grids
- batch processing
- computational complexity
- scheduling policies
- job shop scheduling problem
- greedy algorithm
- error bounds