An improved approximation algorithm for single machine scheduling with job delivery.
Peihai LiuXiwen LuPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- computational cost
- objective function
- detection algorithm
- error bounds
- computational complexity
- simulated annealing
- experimental evaluation
- learning algorithm
- segmentation algorithm
- cost function
- times faster
- significant improvement
- dynamic programming
- worst case
- high accuracy
- preprocessing
- tree structure
- single machine scheduling problem
- approximation schemes
- theoretical analysis
- search space
- similarity measure
- ant colony optimization
- k means
- search algorithm
- optimal solution