A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times.
Yoshiyuki KarunoHiroshi NagamochiPublished in: ESA (2001)
Keyphrases
- np hard
- learning algorithm
- worst case
- scheduling problem
- optimal solution
- k means
- matching algorithm
- computational complexity
- expectation maximization
- significant improvement
- particle swarm optimization
- experimental evaluation
- segmentation algorithm
- benchmark problems
- computational cost
- dynamic programming
- optimal path
- cost function
- preprocessing
- error bounds
- closed form
- approximation ratio
- high accuracy
- optimization algorithm
- theoretical analysis
- simulated annealing
- similarity measure
- neural network
- objective function
- search algorithm