A new three-machine shop scheduling: complexity and approximation algorithm.
Jianming DongYong ChenAn ZhangQifan YangPublished in: J. Comb. Optim. (2013)
Keyphrases
- worst case
- computational complexity
- space complexity
- learning algorithm
- computational cost
- closed form
- detection algorithm
- optimal solution
- cost function
- approximation ratio
- experimental evaluation
- preprocessing
- probabilistic model
- error bounds
- theoretical analysis
- optimization algorithm
- objective function
- complexity analysis
- times faster
- similarity measure
- matching algorithm
- dynamic programming
- significant improvement
- lower bound
- particle swarm optimization
- simulated annealing
- memory requirements
- parallel machines
- linear complexity
- polygonal approximation