A Relax-and-Solve Algorithm for the Ordered Flow-Shop Scheduling Problem.
Mostafa KhatamiAmir SalehipourPublished in: IEEM (2020)
Keyphrases
- experimental evaluation
- preprocessing
- cost function
- estimation algorithm
- dynamic programming
- learning algorithm
- classification algorithm
- optimization algorithm
- np hard
- objective function
- optimal solution
- times faster
- theoretical analysis
- simulated annealing
- high accuracy
- computational cost
- computational complexity
- k means
- decision trees
- knn
- improved algorithm
- selection algorithm
- knapsack problem
- search space
- tree structure
- experimental study
- clustering method
- segmentation algorithm
- significant improvement
- expectation maximization
- particle swarm optimization
- linear programming
- probabilistic model
- worst case