Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines.
Maxim SviridenkoAndreas WiesePublished in: IPCO (2013)
Keyphrases
- sum of completion times
- scheduling problem
- lower bound
- flowshop
- completion times
- parallel machines
- np hard
- single machine
- linear programming
- upper bound
- processing times
- objective function
- tabu search
- optimal solution
- weighted sum
- single machine scheduling problem
- feasible solution
- branch and bound
- branch and bound algorithm
- linear program
- lower and upper bounds
- precedence constraints
- special case
- primal dual
- resource allocation