Approximation Algorithms for 2-Stage Stochastic Scheduling Problems.
David B. ShmoysMauro SozioPublished in: IPCO (2007)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- approximation schemes
- precedence constraints
- special case
- minimum cost
- worst case
- single machine
- vertex cover
- flowshop
- network design problem
- facility location problem
- strongly np hard
- processing times
- np hardness
- randomized algorithms
- primal dual
- setup times
- lower bound
- constant factor
- open shop
- approximation ratio
- undirected graph
- combinatorial auctions
- integer programming
- job shop scheduling problem
- set cover
- branch and bound algorithm
- sequence dependent setup times
- linear programming
- tabu search
- computational complexity
- job shop
- evolutionary algorithm
- search space
- genetic algorithm