A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem.
Berna DengizCigdem Alabas-UsluIhsan SabuncuogluPublished in: CISched (2009)
Keyphrases
- search algorithm
- tabu search
- optimal solution
- combinatorial optimization
- simulated annealing
- neighborhood search
- search procedure
- hill climbing
- domain independent planning
- job shop scheduling problem
- search strategies
- iterated local search
- genetic algorithm
- search space
- search heuristics
- simulated annealing and tabu search
- tree search
- search procedures
- special case
- heuristic methods
- tie breaking
- metaheuristic
- parameter settings
- greedy search
- global search
- exact algorithms
- random sat instances
- stochastic local search
- initial solution
- beam search
- memetic algorithm
- branch and bound
- candidate solutions
- heuristic search
- multi objective
- evolutionary algorithm
- dynamic programming
- neural network
- parameter space
- traveling salesman problem