A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times.
Yoshiyuki KarunoHiroshi NagamochiPublished in: ISAAC (2001)
Keyphrases
- polynomial time approximation
- np hard
- scheduling problem
- approximation algorithms
- minimum cost
- multi depot
- identical machines
- error bounds
- optimal solution
- flowshop
- special case
- single machine
- setup times
- tabu search
- lower bound
- integer programming
- vehicle detection
- precedence constraints
- shortest path
- constraint satisfaction problems
- worst case
- knapsack problem
- pedestrian detection
- processing times
- orders of magnitude
- parallel machines
- linear programming