Improved approximation algorithms for scheduling with fixed jobs.
Florian DiedrichKlaus JansenPublished in: SODA (2009)
Keyphrases
- approximation algorithms
- precedence constraints
- open shop
- np hard
- scheduling problem
- unrelated parallel machines
- strongly np hard
- release dates
- identical parallel machines
- special case
- parallel machines
- vertex cover
- worst case
- identical machines
- job shop
- minimum cost
- polynomial time approximation
- fixed number
- single machine scheduling problem
- primal dual
- setup times
- processing times
- sequence dependent setup times
- job scheduling
- flowshop
- approximation schemes
- approximation ratio
- facility location problem
- randomized algorithms
- network design problem
- batch processing
- scheduling algorithm
- scheduling strategy
- set cover
- computational grids
- scheduling policies
- constant factor
- optimal solution
- single machine
- lower bound
- completion times
- undirected graph
- branch and bound algorithm
- disjoint paths
- search algorithm