Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan.
Donald DavendraIvan ZelinkaMagdalena Bialic-DavendraRoman SenkerikRoman JasekPublished in: Math. Comput. Model. (2013)
Keyphrases
- k means
- np hard
- significant improvement
- dynamic programming
- experimental evaluation
- optimal solution
- detection algorithm
- expectation maximization
- improved algorithm
- preprocessing
- simulated annealing
- learning algorithm
- worst case
- matching algorithm
- segmentation algorithm
- high accuracy
- computational cost
- search space
- upper bound
- scheduling problem
- linear programming
- input data
- computationally efficient
- theoretical analysis
- mobile robot
- optimization algorithm
- tree structure
- lower bound
- recognition algorithm
- computational complexity
- hybrid genetic algorithm