Approximation algorithms for UET scheduling problems with exact delays.
Alexander A. AgeevAlexei E. BaburinPublished in: Oper. Res. Lett. (2007)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- precedence constraints
- special case
- vertex cover
- single machine
- worst case
- minimum cost
- facility location problem
- flowshop
- np complete
- np hardness
- exact algorithms
- setup times
- approximation ratio
- lower bound
- primal dual
- integer programming
- strongly np hard
- processing times
- job shop scheduling
- network design problem
- open shop
- branch and bound algorithm
- computational complexity
- optimal solution
- greedy heuristic
- set cover
- constant factor
- polynomial time approximation
- constraint satisfaction problems
- job shop scheduling problem
- parallel machines
- undirected graph
- combinatorial auctions
- randomized algorithms
- approximation schemes
- linear programming
- exact solution
- linear program
- job shop