Approximation algorithms for the single-machine scheduling with a period of maintenance.
Ganggang LiXiwen LuPublished in: Optim. Lett. (2016)
Keyphrases
- approximation algorithms
- precedence constraints
- preventive maintenance
- np hard
- special case
- vertex cover
- worst case
- primal dual
- facility location problem
- approximation ratio
- approximation schemes
- set cover
- network design problem
- constant factor
- minimum cost
- open shop
- single machine scheduling problem
- disjoint paths
- np hardness
- scheduling problem
- setup times
- randomized algorithms
- polynomial time approximation
- deteriorating jobs
- combinatorial auctions