A polynomial algorithm for a one machine batching problem.
David F. ShallcrossPublished in: Oper. Res. Lett. (1992)
Keyphrases
- computational cost
- preprocessing
- worst case
- np hard
- dynamic programming
- optimization algorithm
- improved algorithm
- expectation maximization
- high accuracy
- recognition algorithm
- experimental evaluation
- segmentation algorithm
- learning algorithm
- cost function
- classification algorithm
- times faster
- selection algorithm
- similarity measure
- clustering method
- parallel machines
- scheduling problem
- theoretical analysis
- computationally efficient
- mobile robot
- k means
- search space
- data structure
- optimal solution
- decision trees
- feature selection