Approach by localization and genetic manipulation algorithm for flexible job-shop scheduling problem.
Imed KacemSlim HammadiPierre BornePublished in: SMC (2001)
Keyphrases
- k means
- learning algorithm
- experimental evaluation
- worst case
- computational cost
- localization algorithm
- objective function
- preprocessing
- dynamic programming
- neural network
- single pass
- optimization algorithm
- theoretical analysis
- cost function
- np hard
- data sets
- similarity measure
- improved algorithm
- benchmark problems
- detection algorithm
- computational complexity
- segmentation algorithm
- high accuracy
- significant improvement
- convex hull
- expectation maximization
- multi robot
- input data
- job shop scheduling problem
- simulated annealing