A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times.
Daya Ram GaurArvind GuptaRamesh KrishnamurtiPublished in: Inf. Process. Lett. (2003)
Keyphrases
- learning algorithm
- np hard
- theoretical analysis
- detection algorithm
- cost function
- experimental evaluation
- computational cost
- preprocessing
- k means
- high accuracy
- times faster
- closed form
- simulated annealing
- search space
- computational complexity
- worst case
- real time
- probabilistic model
- dynamic programming
- optimization algorithm
- response time
- expectation maximization
- ant colony optimization
- lower bound
- error bounds
- convergence rate
- recognition algorithm
- shortest path problem
- parallel processors