Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
Cor A. J. HurkensTjark VredeveldPublished in: Oper. Res. Lett. (2003)
Keyphrases
- search algorithm
- search space
- memetic algorithm
- simulated annealing
- optimal solution
- global optimum
- genetic algorithm
- global search
- tabu search
- combinatorial optimization
- hooke jeeves
- job shop scheduling problem
- multi start
- search procedure
- particle swarm optimization
- control parameters
- systematic search
- satisfiability testing
- global optimization
- real time
- lower bound
- objective function
- search engine
- learning algorithm
- information retrieval
- real world
- neural network
- databases