Approximation algorithms for single machine scheduling with one unavailability period.
Imed KacemMohamed HaouariPublished in: 4OR (2009)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- facility location problem
- network design problem
- approximation ratio
- set cover
- open shop
- single machine scheduling problem
- primal dual
- sequence dependent setup times
- deteriorating jobs
- approximation schemes
- approximation guarantees
- np hardness
- constant factor
- disjoint paths
- lower bound
- setup times
- greedy algorithm
- multistage