Heuristic construction algorithm for the job shop problem with several robots and subject to blocking and no.-wait constraint.
Saad LouaqadOualid KamachPublished in: CIST (2014)
Keyphrases
- dynamic programming
- optimal solution
- learning algorithm
- worst case
- preprocessing
- simulated annealing
- computational cost
- times faster
- cost function
- objective function
- bin packing
- multi robot
- matching algorithm
- constrained minimization
- similarity measure
- heuristic methods
- knapsack problem
- combinatorial optimization
- tabu search
- optimization algorithm
- segmentation algorithm
- expectation maximization
- k means
- detection algorithm
- solution quality
- space complexity
- memetic algorithm
- job shop scheduling problem
- packing problem
- running times
- greedy heuristic
- optimal or near optimal
- closest string