2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
Yoshiyuki KarunoHiroshi NagamochiPublished in: Discret. Appl. Math. (2003)
Keyphrases
- approximation algorithms
- np hard
- scheduling problem
- minimum cost
- special case
- precedence constraints
- single machine
- vertex cover
- worst case
- strongly np hard
- disjoint paths
- flowshop
- optimal solution
- facility location problem
- np hardness
- randomized algorithms
- approximation ratio
- tabu search
- exact algorithms
- integer programming
- approximation schemes
- lower bound
- branch and bound algorithm
- primal dual
- parallel machines
- linear programming
- set cover
- linear program
- processing times
- computational complexity
- job shop
- job shop scheduling problem
- shortest path
- network design problem
- spanning tree
- sequence dependent setup times
- constant factor approximation
- release dates
- job shop scheduling
- undirected graph
- constant factor
- search algorithm