Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection.
Jinwen OuPublished in: J. Sched. (2020)
Keyphrases
- batch processing
- approximation algorithms
- worst case
- np hard
- scheduling jobs
- special case
- minimum cost
- vertex cover
- network design problem
- facility location problem
- precedence constraints
- set cover
- approximation ratio
- np hardness
- randomized algorithms
- primal dual
- constant factor
- approximation schemes
- disjoint paths
- open shop
- greedy algorithm
- error bounds
- constant factor approximation
- combinatorial auctions
- upper bound
- scheduling problem
- strongly np hard
- lower bound
- branch and bound algorithm