A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes.
N. Rafiee ParsaBehrooz KarimiAli Husseinzadeh KashanPublished in: Comput. Oper. Res. (2010)
Keyphrases
- detection algorithm
- times faster
- experimental evaluation
- objective function
- recognition algorithm
- computational complexity
- dynamic programming
- high accuracy
- computational cost
- significant improvement
- k means
- improved algorithm
- optimal solution
- theoretical analysis
- convex hull
- learning algorithm
- estimation algorithm
- single pass
- space complexity
- neural network
- path planning
- tree structure
- ant colony optimization
- computationally efficient
- expectation maximization
- cost function
- lower bound
- similarity measure