NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time.
Jinjiang YuanT. C. Edwin ChengC. T. NgPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- np hardness
- scheduling problem
- np hard
- flowshop
- single machine
- processing times
- approximation algorithms
- special case
- lower bound
- minimize total
- worst case analysis
- resource consumption
- mixed integer
- integer programming
- branch and bound algorithm
- worst case
- combinatorial optimization
- precedence constraints
- decision problems
- tabu search
- linear programming