On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems.
R. N. UmaJoel WeinDavid P. WilliamsonPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- np hard
- scheduling problem
- lower bound
- linear programming
- upper bound
- optimal solution
- linear program
- single machine
- branch and bound algorithm
- approximation algorithms
- np complete
- flowshop
- branch and bound
- worst case
- objective function
- integer programming
- processing times
- setup times
- np hardness
- minimum cost
- precedence constraints
- job shop
- feasible solution
- tabu search
- constraint satisfaction problems
- lagrangian relaxation
- greedy heuristic
- job shop scheduling
- greedy heuristics
- parallel machines
- lower and upper bounds
- set cover
- knapsack problem
- randomly generated test problems
- min sum
- special case
- linear programming relaxation
- max sat
- sequence dependent setup times
- job shop scheduling problem
- search algorithm for solving
- lp relaxation
- mixed integer
- search algorithm
- approximation ratio
- approximation guarantees
- primal dual
- image registration
- list scheduling
- simulated annealing