Job Scheduling Under Differential Pricing: Hardness and Approximation Algorithms.
Qiuyuan HuangJing ZhaoHaohua DuJiahui HouXiang-Yang LiPublished in: WASA (2017)
Keyphrases
- approximation algorithms
- job scheduling
- np hard
- np hardness
- worst case
- special case
- minimum cost
- grid environment
- load balancing
- computational complexity
- primal dual
- np complete
- scheduling problem
- constant factor
- vertex cover
- integer programming
- lower bound
- approximation ratio
- randomized algorithms
- optimal solution
- resource allocation
- upper bound
- precedence constraints
- polynomial time approximation
- identical machines
- branch and bound algorithm
- combinatorial auctions