On Approximation Algorithms for Two-Stage Scheduling Problems.
Guangwei WuJianer ChenJianxin WangPublished in: FAW (2017)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- precedence constraints
- single machine
- np complete
- special case
- facility location problem
- vertex cover
- flowshop
- processing times
- worst case
- tabu search
- minimum cost
- np hardness
- open shop
- integer programming
- approximation ratio
- job shop scheduling
- linear programming
- lower bound
- set cover
- branch and bound algorithm
- network design problem
- setup times
- approximation schemes
- undirected graph
- optimal solution
- parallel machines
- job shop
- strongly np hard
- greedy heuristic
- disjoint paths
- knapsack problem
- computational complexity
- constant factor approximation
- polynomial time approximation
- constant factor
- primal dual
- job shop scheduling problem