Approximation algorithms for shop scheduling problems with minsum objective: A correction.
Wenhua LiMaurice QueyranneMaxim SviridenkoJinjiang YuanPublished in: J. Sched. (2006)
Keyphrases
- approximation algorithms
- np hard
- scheduling problem
- min sum
- special case
- precedence constraints
- minimum cost
- vertex cover
- single machine
- lower bound
- processing times
- optimal solution
- flowshop
- worst case
- primal dual
- set cover
- integer programming
- computational complexity
- job shop scheduling problem
- job shop scheduling
- strongly np hard
- approximation ratio
- knapsack problem
- parallel machines
- linear programming
- setup times
- completion times
- tabu search
- dynamic programming
- branch and bound algorithm
- constraint satisfaction problems
- upper bound
- constant factor
- undirected graph
- job shop
- linear program