Smart General Variable Neighborhood Search with Local Search based on Mathematical Programming for Solving the Unrelated Parallel Machine Scheduling Problem.
Marcelo Ferreira RegoMarcone Jamilson Freitas SouzaPublished in: ICEIS (1) (2019)
Keyphrases
- mathematical programming
- combinatorial optimization
- variable neighborhood search
- metaheuristic
- traveling salesman problem
- total weighted tardiness
- vehicle routing problem
- single machine scheduling problem
- tabu search
- job shop scheduling problem
- path relinking
- combinatorial optimization problems
- linear programming
- simulated annealing
- special case
- tree search
- search procedure
- branch and bound algorithm
- single machine
- optimal solution
- memetic algorithm
- release dates
- sequence dependent setup times
- benchmark instances
- optimization problems
- genetic algorithm
- ant colony optimization
- search space
- hybrid method
- branch and bound
- heuristic methods
- particle swarm optimization
- evolutionary algorithm