Minimizing the total completion time on a multi-machine FMS using flower pollination algorithm.
N. Sivarami ReddyD. V. RamamurthyM. Padma LalithaK. Prahlada RaoPublished in: Soft Comput. (2022)
Keyphrases
- dynamic programming
- search space
- computational complexity
- experimental evaluation
- matching algorithm
- theoretical analysis
- learning algorithm
- cost function
- high accuracy
- computationally efficient
- preprocessing
- times faster
- objective function
- improved algorithm
- detection algorithm
- tree structure
- similarity measure
- special case
- significant improvement
- k means
- evolutionary algorithm
- artificial neural networks
- segmentation algorithm
- single pass
- hardware implementation
- reinforcement learning
- convex hull
- optimal solution
- support vector
- multi objective
- particle swarm optimization
- linear programming
- denoising
- probabilistic model
- computational cost