A Parallel Variable Neighborhood Search for Solving Real-World Production-Scheduling Problems.
Eneko OsabaErlantz LoizagaXabier GoenagaValentín SánchezPublished in: IDEAL (2021)
Keyphrases
- variable neighborhood search
- scheduling problem
- tabu search
- metaheuristic
- parallel machines
- heuristic methods
- single machine
- combinatorial optimization
- benchmark instances
- job shop scheduling problem
- traveling salesman problem
- processing times
- single machine scheduling problem
- path relinking
- vehicle routing problem
- flowshop
- routing problem
- minimum spanning tree
- hybrid method
- simulated annealing
- genetic algorithm
- precedence constraints
- scatter search
- sequence dependent setup times
- job shop
- search procedure
- evolutionary algorithm
- parallel computing
- memetic algorithm
- dynamic programming
- np hard
- search space
- neural network