An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems.
Martin W. P. SavelsberghR. N. UmaJoel WeinPublished in: SODA (1998)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- linear programming
- primal dual
- linear program
- optimal solution
- single machine
- special case
- minimum cost
- worst case
- flowshop
- precedence constraints
- vertex cover
- lower bound
- quadratic program
- network design problem
- integer programming
- processing times
- branch and bound algorithm
- np hardness
- setup times
- set cover
- job shop scheduling
- tabu search
- knapsack problem
- parallel machines
- approximation ratio
- facility location problem
- computational complexity
- constraint satisfaction problems
- job shop
- open shop
- greedy heuristic
- approximation schemes
- job shop scheduling problem
- constant factor
- sequence dependent setup times
- randomized algorithms
- objective function
- production scheduling
- valid inequalities
- lagrangian relaxation
- feasible solution
- search algorithm
- constant factor approximation