Approximation Algorithms for Certain Scheduling Problems.
Oscar H. IbarraChul E. KimPublished in: Math. Oper. Res. (1978)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- minimum cost
- single machine
- flowshop
- worst case
- special case
- precedence constraints
- processing times
- optimal solution
- network design problem
- lower bound
- tabu search
- np hardness
- integer programming
- np complete
- vertex cover
- job shop scheduling
- constant factor
- facility location problem
- setup times
- set cover
- open shop
- randomized algorithms
- job shop scheduling problem
- approximation ratio
- approximation schemes
- sequence dependent setup times
- job shop
- primal dual
- parallel machines
- linear programming
- undirected graph
- lagrangian relaxation
- knapsack problem
- branch and bound algorithm
- constraint satisfaction problems
- disjoint paths
- constant factor approximation
- strongly np hard
- polynomial time approximation
- greedy heuristic
- error bounds
- computational complexity