Approximation Algorithms for the Multi-Vehicle Scheduling Problem.
Binay K. BhattacharyaYuzhuang HuPublished in: ISAAC (2) (2010)
Keyphrases
- approximation algorithms
- np hard
- scheduling problem
- precedence constraints
- special case
- vertex cover
- worst case
- single machine
- facility location problem
- strongly np hard
- integer programming
- np hardness
- flowshop
- minimum cost
- optimal solution
- exact algorithms
- processing times
- randomized algorithms
- tabu search
- linear programming
- network design problem
- open shop
- approximation schemes
- branch and bound algorithm
- primal dual
- constant factor
- approximation ratio
- disjoint paths
- set cover
- setup times
- sequence dependent setup times
- parallel machines
- combinatorial auctions
- knapsack problem
- linear program
- lower bound
- computational complexity
- job shop scheduling
- job shop
- polynomial time approximation