Approximation Algorithms for Scheduling Problems with Exact Delays.
Alexander A. AgeevAlexander V. KononovPublished in: WAOA (2006)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- precedence constraints
- job shop
- open shop
- flowshop
- minimum cost
- vertex cover
- single machine
- special case
- worst case
- facility location problem
- processing times
- np hardness
- network design problem
- job shop scheduling
- primal dual
- set cover
- setup times
- linear programming
- approximation ratio
- exact algorithms
- approximation schemes
- strongly np hard
- tabu search
- branch and bound algorithm
- np complete
- randomized algorithms
- parallel machines
- disjoint paths
- undirected graph
- job shop scheduling problem
- constant factor approximation
- sequence dependent setup times
- lagrangian relaxation
- genetic algorithm
- exact solution
- weighted sum
- integer programming
- linear program
- lower bound