Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems.
Julia ChuzhoyRafail OstrovskyYuval RabaniPublished in: Math. Oper. Res. (2006)
Keyphrases
- disjoint paths
- strongly np hard
- approximation algorithms
- np hard
- scheduling problem
- flowshop
- special case
- vertex cover
- facility location problem
- worst case
- precedence constraints
- processing times
- undirected graph
- network design problem
- minimum cost
- setup times
- approximation ratio
- randomized algorithms
- primal dual
- lower bound
- open shop
- maximum lateness
- set cover
- job shop
- approximation schemes
- np hardness
- single machine scheduling problem
- linear program
- single machine